/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:55:07,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:55:07,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:55:07,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:55:07,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:55:07,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:55:07,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:55:07,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:55:07,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:55:07,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:55:07,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:55:07,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:55:07,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:55:07,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:55:07,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:55:07,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:55:07,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:55:07,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:55:07,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:55:07,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:55:07,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:55:07,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:55:07,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:55:07,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:55:07,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:55:07,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:55:07,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:55:07,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:55:07,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:55:07,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:55:07,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:55:07,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:55:07,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:55:07,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:55:07,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:55:07,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:55:07,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:55:07,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:55:07,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:55:07,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:55:07,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:55:07,579 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:55:07,593 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:55:07,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:55:07,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:55:07,595 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:55:07,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:55:07,595 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:55:07,596 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:55:07,596 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:55:07,596 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:55:07,596 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:55:07,596 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:55:07,597 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:55:07,597 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:55:07,597 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:55:07,597 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:55:07,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:55:07,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:55:07,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:55:07,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:55:07,598 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:55:07,598 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:55:07,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:55:07,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:55:07,599 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:55:07,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:55:07,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:55:07,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:55:07,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:55:07,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:55:07,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:55:07,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:55:07,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:55:07,787 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:55:07,787 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:55:07,788 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:55:07,853 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_16Bcvl/tmp/c93d886b8ab84f5d9a443550bb7d6cc0/FLAG619c5c343 [2020-07-01 12:55:08,187 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:55:08,188 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:55:08,189 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:55:08,195 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_16Bcvl/tmp/c93d886b8ab84f5d9a443550bb7d6cc0/FLAG619c5c343 [2020-07-01 12:55:08,590 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_16Bcvl/tmp/c93d886b8ab84f5d9a443550bb7d6cc0 [2020-07-01 12:55:08,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:55:08,603 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:55:08,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:55:08,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:55:08,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:55:08,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b2e04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08, skipping insertion in model container [2020-07-01 12:55:08,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:55:08,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:55:08,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:55:08,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:55:08,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:55:08,916 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:55:08,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08 WrapperNode [2020-07-01 12:55:08,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:55:08,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:55:08,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:55:08,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:55:08,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:55:08,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:55:08,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:55:08,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:55:08,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... [2020-07-01 12:55:08,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:55:08,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:55:08,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:55:08,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:55:08,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:55:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:55:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:55:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:55:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:55:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:55:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:55:09,405 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:55:09,405 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:55:09,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:55:09 BoogieIcfgContainer [2020-07-01 12:55:09,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:55:09,410 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:55:09,410 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:55:09,413 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:55:09,413 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:55:09" (1/1) ... [2020-07-01 12:55:09,429 INFO L313 BlockEncoder]: Initial Icfg 57 locations, 59 edges [2020-07-01 12:55:09,430 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:55:09,431 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:55:09,431 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:55:09,432 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:55:09,434 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:55:09,435 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:55:09,435 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:55:09,462 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:55:09,506 INFO L200 BlockEncoder]: SBE split 31 edges [2020-07-01 12:55:09,512 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:55:09,514 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:55:09,547 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:55:09,550 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:55:09,551 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:55:09,552 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:55:09,552 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:55:09,553 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:55:09,553 INFO L313 BlockEncoder]: Encoded RCFG 49 locations, 95 edges [2020-07-01 12:55:09,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:55:09 BasicIcfg [2020-07-01 12:55:09,554 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:55:09,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:55:09,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:55:09,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:55:09,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:55:08" (1/4) ... [2020-07-01 12:55:09,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b06b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:55:09, skipping insertion in model container [2020-07-01 12:55:09,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (2/4) ... [2020-07-01 12:55:09,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b06b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:55:09, skipping insertion in model container [2020-07-01 12:55:09,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:55:09" (3/4) ... [2020-07-01 12:55:09,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b06b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:55:09, skipping insertion in model container [2020-07-01 12:55:09,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:55:09" (4/4) ... [2020-07-01 12:55:09,562 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:55:09,573 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:55:09,581 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-01 12:55:09,595 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-01 12:55:09,619 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:55:09,619 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:55:09,619 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:55:09,620 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:55:09,620 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:55:09,620 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:55:09,620 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:55:09,620 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:55:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-07-01 12:55:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:55:09,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:09,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:55:09,643 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 124524, now seen corresponding path program 1 times [2020-07-01 12:55:09,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:09,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99946633] [2020-07-01 12:55:09,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:09,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99946633] [2020-07-01 12:55:09,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:09,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:09,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536965679] [2020-07-01 12:55:09,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:09,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:09,845 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-01 12:55:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,056 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2020-07-01 12:55:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:55:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,070 INFO L225 Difference]: With dead ends: 96 [2020-07-01 12:55:10,070 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 12:55:10,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 12:55:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 12:55:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:55:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2020-07-01 12:55:10,113 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 80 transitions. Word has length 3 [2020-07-01 12:55:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,113 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 80 transitions. [2020-07-01 12:55:10,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 80 transitions. [2020-07-01 12:55:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:55:10,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:55:10,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:55:10,116 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 124803, now seen corresponding path program 1 times [2020-07-01 12:55:10,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334352215] [2020-07-01 12:55:10,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334352215] [2020-07-01 12:55:10,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55290222] [2020-07-01 12:55:10,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,185 INFO L87 Difference]: Start difference. First operand 49 states and 80 transitions. Second operand 3 states. [2020-07-01 12:55:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,312 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2020-07-01 12:55:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:55:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,314 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:55:10,314 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:55:10,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:55:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:55:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:55:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2020-07-01 12:55:10,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 3 [2020-07-01 12:55:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,321 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2020-07-01 12:55:10,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2020-07-01 12:55:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:55:10,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:55:10,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:55:10,323 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash 124805, now seen corresponding path program 1 times [2020-07-01 12:55:10,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184824585] [2020-07-01 12:55:10,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184824585] [2020-07-01 12:55:10,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177212177] [2020-07-01 12:55:10,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,372 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2020-07-01 12:55:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,507 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2020-07-01 12:55:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:55:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,509 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:55:10,509 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:55:10,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:55:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 12:55:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 12:55:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2020-07-01 12:55:10,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 3 [2020-07-01 12:55:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,514 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2020-07-01 12:55:10,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2020-07-01 12:55:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:55:10,515 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:55:10,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:55:10,516 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 3866321, now seen corresponding path program 1 times [2020-07-01 12:55:10,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919880224] [2020-07-01 12:55:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919880224] [2020-07-01 12:55:10,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110742778] [2020-07-01 12:55:10,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,560 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand 3 states. [2020-07-01 12:55:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,668 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. [2020-07-01 12:55:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:55:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,670 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:55:10,670 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:55:10,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:55:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:55:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:55:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2020-07-01 12:55:10,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 4 [2020-07-01 12:55:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,675 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2020-07-01 12:55:10,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2020-07-01 12:55:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:55:10,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:55:10,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:55:10,676 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 3866323, now seen corresponding path program 1 times [2020-07-01 12:55:10,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577681400] [2020-07-01 12:55:10,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577681400] [2020-07-01 12:55:10,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669640329] [2020-07-01 12:55:10,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,735 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 3 states. [2020-07-01 12:55:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,817 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2020-07-01 12:55:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:55:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,818 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:55:10,818 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:55:10,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:55:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:55:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:55:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-07-01 12:55:10,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 4 [2020-07-01 12:55:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,823 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-07-01 12:55:10,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-07-01 12:55:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:55:10,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:55:10,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:55:10,825 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,825 INFO L82 PathProgramCache]: Analyzing trace with hash 119853136, now seen corresponding path program 1 times [2020-07-01 12:55:10,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550178277] [2020-07-01 12:55:10,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550178277] [2020-07-01 12:55:10,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903761704] [2020-07-01 12:55:10,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,868 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 3 states. [2020-07-01 12:55:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:10,941 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2020-07-01 12:55:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:10,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:55:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:10,943 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:55:10,943 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:55:10,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:55:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:55:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:55:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-07-01 12:55:10,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 5 [2020-07-01 12:55:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:10,947 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-01 12:55:10,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2020-07-01 12:55:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:55:10,948 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:10,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:55:10,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:55:10,948 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 119853137, now seen corresponding path program 1 times [2020-07-01 12:55:10,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:10,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804086821] [2020-07-01 12:55:10,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:10,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804086821] [2020-07-01 12:55:10,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:10,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123081265] [2020-07-01 12:55:10,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:10,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:10,977 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 3 states. [2020-07-01 12:55:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,030 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-01 12:55:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:55:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:11,031 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:55:11,031 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:55:11,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:55:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:55:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:55:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-01 12:55:11,035 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 5 [2020-07-01 12:55:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:11,036 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-01 12:55:11,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2020-07-01 12:55:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:55:11,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:11,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:55:11,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:55:11,037 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash 119853138, now seen corresponding path program 1 times [2020-07-01 12:55:11,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990138952] [2020-07-01 12:55:11,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:11,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990138952] [2020-07-01 12:55:11,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:11,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:11,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104573239] [2020-07-01 12:55:11,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:11,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,078 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 3 states. [2020-07-01 12:55:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,134 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-07-01 12:55:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:55:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:11,136 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:55:11,136 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:55:11,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:55:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:55:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:55:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 12:55:11,139 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 5 [2020-07-01 12:55:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:11,140 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 12:55:11,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 12:55:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:55:11,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:11,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:55:11,141 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash -579522303, now seen corresponding path program 1 times [2020-07-01 12:55:11,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721490160] [2020-07-01 12:55:11,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:11,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721490160] [2020-07-01 12:55:11,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:11,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:11,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395984130] [2020-07-01 12:55:11,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:11,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,168 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 3 states. [2020-07-01 12:55:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,220 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-01 12:55:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:55:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:11,221 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:55:11,221 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:55:11,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:55:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:55:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:55:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 12:55:11,225 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 6 [2020-07-01 12:55:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:11,225 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:55:11,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-01 12:55:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:55:11,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:11,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:55:11,226 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -579522301, now seen corresponding path program 1 times [2020-07-01 12:55:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591709273] [2020-07-01 12:55:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:11,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591709273] [2020-07-01 12:55:11,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:11,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:11,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712026450] [2020-07-01 12:55:11,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:11,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:11,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:11,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,254 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2020-07-01 12:55:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,273 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-01 12:55:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:55:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:11,274 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:55:11,274 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:55:11,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:55:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:55:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:55:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-01 12:55:11,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2020-07-01 12:55:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:11,278 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-01 12:55:11,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-01 12:55:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:55:11,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:55:11,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:55:11,279 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:55:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -579522300, now seen corresponding path program 1 times [2020-07-01 12:55:11,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897855886] [2020-07-01 12:55:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:11,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897855886] [2020-07-01 12:55:11,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:11,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120527088] [2020-07-01 12:55:11,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:55:11,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:11,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,309 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2020-07-01 12:55:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,340 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-01 12:55:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:55:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:55:11,341 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:55:11,341 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:55:11,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:55:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:55:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:55:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:55:11,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 12:55:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:55:11,343 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:55:11,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:55:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:55:11,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:55:11,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:55:11,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:55:11,386 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,387 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,387 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:55:11,387 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 22) no Hoare annotation was computed. [2020-07-01 12:55:11,387 INFO L264 CegarLoopResult]: At program point L15-3(lines 14 22) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point L15-4(lines 15 22) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:55:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,389 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 20) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point L16-4(lines 16 20) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:55:11,390 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:55:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:55:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:55:11,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:55:11,396 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:55:11,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:55:11,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:55:11,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:55:11 BasicIcfg [2020-07-01 12:55:11,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:55:11,418 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:55:11,419 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:55:11,422 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:55:11,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:55:11,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:55:08" (1/5) ... [2020-07-01 12:55:11,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:55:11, skipping insertion in model container [2020-07-01 12:55:11,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:55:11,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:55:08" (2/5) ... [2020-07-01 12:55:11,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:55:11, skipping insertion in model container [2020-07-01 12:55:11,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:55:11,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:55:09" (3/5) ... [2020-07-01 12:55:11,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:55:11, skipping insertion in model container [2020-07-01 12:55:11,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:55:11,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:55:09" (4/5) ... [2020-07-01 12:55:11,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:55:11, skipping insertion in model container [2020-07-01 12:55:11,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:55:11,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:55:11" (5/5) ... [2020-07-01 12:55:11,426 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:55:11,448 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:55:11,448 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:55:11,449 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:55:11,449 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:55:11,449 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:55:11,449 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:55:11,449 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:55:11,449 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:55:11,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-07-01 12:55:11,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:55:11,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:55:11,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:55:11,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,466 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,466 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:55:11,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-07-01 12:55:11,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:55:11,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:55:11,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:55:11,469 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,469 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:55:11,475 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 7#L-1true [182] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4)) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 22#L11true [94] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 20#L11-1true [90] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 39#L12true [114] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 50#L13true [131] L13-->L15-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 25#L15-3true [2020-07-01 12:55:11,476 INFO L796 eck$LassoCheckResult]: Loop: 25#L15-3true [101] L15-3-->L15: Formula: (and (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 14#L15true [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 27#L15-1true [105] L15-1-->L16: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 30#L16true [109] L16-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= 1 (select |v_#valid_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 29#L16-1true [106] L16-1-->L16-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 43#L16-2true [154] L16-2-->L19: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 19#L19true [87] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 17#L19-1true [248] L19-1-->L16-4: Formula: (and (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_#memory_int_29| (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1)))) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 40#L16-4true [117] L16-4-->L21: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 9#L21true [249] L21-->L15-3: Formula: (and (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_31|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 25#L15-3true [2020-07-01 12:55:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash -573981241, now seen corresponding path program 1 times [2020-07-01 12:55:11,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726331207] [2020-07-01 12:55:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:55:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:55:11,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726331207] [2020-07-01 12:55:11,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:55:11,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:55:11,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513983517] [2020-07-01 12:55:11,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:55:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:55:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 707443269, now seen corresponding path program 1 times [2020-07-01 12:55:11,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:55:11,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115698350] [2020-07-01 12:55:11,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:55:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:55:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:55:11,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:55:11,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:55:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:55:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:55:11,714 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-01 12:55:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:55:11,840 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2020-07-01 12:55:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:55:11,843 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:55:11,847 INFO L168 Benchmark]: Toolchain (without parser) took 3243.62 ms. Allocated memory was 514.9 MB in the beginning and 596.6 MB in the end (delta: 81.8 MB). Free memory was 438.9 MB in the beginning and 540.3 MB in the end (delta: -101.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:55:11,848 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:55:11,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.81 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 438.4 MB in the beginning and 527.4 MB in the end (delta: -89.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.16 ms. Allocated memory is still 560.5 MB. Free memory was 526.8 MB in the beginning and 525.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,849 INFO L168 Benchmark]: Boogie Preprocessor took 25.52 ms. Allocated memory is still 560.5 MB. Free memory was 525.2 MB in the beginning and 523.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,850 INFO L168 Benchmark]: RCFGBuilder took 423.53 ms. Allocated memory is still 560.5 MB. Free memory was 523.1 MB in the beginning and 496.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,850 INFO L168 Benchmark]: BlockEncodingV2 took 143.61 ms. Allocated memory is still 560.5 MB. Free memory was 496.0 MB in the beginning and 483.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,851 INFO L168 Benchmark]: TraceAbstraction took 1862.92 ms. Allocated memory was 560.5 MB in the beginning and 587.2 MB in the end (delta: 26.7 MB). Free memory was 481.9 MB in the beginning and 408.6 MB in the end (delta: 73.4 MB). Peak memory consumption was 100.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:55:11,852 INFO L168 Benchmark]: BuchiAutomizer took 426.22 ms. Allocated memory was 587.2 MB in the beginning and 596.6 MB in the end (delta: 9.4 MB). Free memory was 408.6 MB in the beginning and 540.3 MB in the end (delta: -131.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:55:11,855 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 57 locations, 59 edges - StatisticsResult: Encoded RCFG 49 locations, 95 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.81 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 438.4 MB in the beginning and 527.4 MB in the end (delta: -89.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.16 ms. Allocated memory is still 560.5 MB. Free memory was 526.8 MB in the beginning and 525.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.52 ms. Allocated memory is still 560.5 MB. Free memory was 525.2 MB in the beginning and 523.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 423.53 ms. Allocated memory is still 560.5 MB. Free memory was 523.1 MB in the beginning and 496.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 143.61 ms. Allocated memory is still 560.5 MB. Free memory was 496.0 MB in the beginning and 483.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1862.92 ms. Allocated memory was 560.5 MB in the beginning and 587.2 MB in the end (delta: 26.7 MB). Free memory was 481.9 MB in the beginning and 408.6 MB in the end (delta: 73.4 MB). Peak memory consumption was 100.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 426.22 ms. Allocated memory was 587.2 MB in the beginning and 596.6 MB in the end (delta: 9.4 MB). Free memory was 408.6 MB in the beginning and 540.3 MB in the end (delta: -131.8 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:55:11,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:55:11,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:55:11,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:55:11,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 472 SDslu, 6 SDs, 0 SdLazy, 446 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:55:05.341 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_16Bcvl/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:55:12.093 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check