./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:54:28,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:54:28,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:54:28,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:54:28,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:54:28,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:54:28,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:54:28,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:54:28,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:54:28,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:54:28,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:54:28,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:54:28,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:54:28,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:54:28,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:54:28,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:54:28,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:54:28,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:54:28,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:54:28,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:54:28,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:54:28,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:54:28,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:54:28,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:54:28,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:54:28,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:54:28,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:54:28,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:54:28,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:54:28,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:54:28,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:54:28,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:54:28,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:54:28,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:54:28,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:54:28,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:54:28,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:54:29,016 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:54:29,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:54:29,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:54:29,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:54:29,020 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:54:29,020 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:54:29,021 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:54:29,021 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:54:29,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:54:29,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:54:29,023 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:54:29,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:54:29,024 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:54:29,025 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:54:29,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:54:29,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:54:29,025 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:54:29,025 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:54:29,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:54:29,026 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:54:29,029 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:54:29,029 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:54:29,030 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-01-01 22:54:29,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:54:29,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:54:29,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:54:29,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:54:29,103 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:54:29,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-01 22:54:29,160 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5021619d9/0abc68c02ce1489a85b903588d288d56/FLAG254e51b35 [2019-01-01 22:54:29,659 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:54:29,660 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-01 22:54:29,667 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5021619d9/0abc68c02ce1489a85b903588d288d56/FLAG254e51b35 [2019-01-01 22:54:29,989 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5021619d9/0abc68c02ce1489a85b903588d288d56 [2019-01-01 22:54:29,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:54:29,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:54:29,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:54:29,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:54:29,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:54:29,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:54:29" (1/1) ... [2019-01-01 22:54:30,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c2f308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:29, skipping insertion in model container [2019-01-01 22:54:30,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:54:29" (1/1) ... [2019-01-01 22:54:30,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:54:30,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:54:30,232 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:54:30,246 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:54:30,274 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:54:30,301 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:54:30,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30 WrapperNode [2019-01-01 22:54:30,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:54:30,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:54:30,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:54:30,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:54:30,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:54:30,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:54:30,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:54:30,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:54:30,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... [2019-01-01 22:54:30,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:54:30,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:54:30,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:54:30,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:54:30,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:54:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 22:54:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 22:54:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 22:54:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 22:54:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:54:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:54:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:54:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:54:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:54:31,084 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:54:31,084 INFO L280 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-01 22:54:31,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:54:31 BoogieIcfgContainer [2019-01-01 22:54:31,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:54:31,086 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:54:31,086 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:54:31,090 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:54:31,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:54:31,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:54:29" (1/3) ... [2019-01-01 22:54:31,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f070bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:54:31, skipping insertion in model container [2019-01-01 22:54:31,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:54:31,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:54:30" (2/3) ... [2019-01-01 22:54:31,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f070bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:54:31, skipping insertion in model container [2019-01-01 22:54:31,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:54:31,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:54:31" (3/3) ... [2019-01-01 22:54:31,095 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-01 22:54:31,156 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:54:31,157 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:54:31,157 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:54:31,157 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:54:31,157 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:54:31,158 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:54:31,158 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:54:31,158 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:54:31,158 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:54:31,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-01 22:54:31,196 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-01-01 22:54:31,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:31,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:31,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:54:31,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:54:31,203 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:54:31,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-01 22:54:31,206 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-01-01 22:54:31,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:31,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:31,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:54:31,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:54:31,215 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 4#L-1true havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 31#L17-3true [2019-01-01 22:54:31,215 INFO L796 eck$LassoCheckResult]: Loop: 31#L17-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 17#L17-2true init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 31#L17-3true [2019-01-01 22:54:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:54:31,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:31,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:31,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:31,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 22:54:31,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:31,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 22:54:31,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:31,659 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 22:54:31,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:54:31,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:54:31,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:54:31,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2019-01-01 22:54:32,143 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 22:54:32,287 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 22:54:32,410 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 22:54:32,424 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:54:32,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:54:32,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:54:32,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:54:32,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:54:32,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:54:32,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:54:32,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:54:32,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2019-01-01 22:54:32,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:54:32,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:54:32,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:32,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,212 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-01 22:54:33,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:54:33,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:54:33,928 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:54:33,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:33,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:33,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:33,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:33,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:33,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:33,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:33,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:33,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:33,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:33,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:33,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:33,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,071 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:54:34,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,081 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:54:34,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:34,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:34,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:34,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:34,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:34,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:34,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:54:34,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:54:34,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:54:34,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:54:34,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:54:34,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:54:34,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:54:34,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:54:34,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:54:34,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:54:34,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:54:34,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:54:34,287 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 22:54:34,289 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:54:34,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:54:34,295 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:54:34,296 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:54:34,296 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 1*v_rep(select #length ~#pp~0.base)_1 - 3*ULTIMATE.start_init_~i~0 Supporting invariants [] [2019-01-01 22:54:34,336 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-01 22:54:34,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:54:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:34,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:54:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:34,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:54:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:34,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:54:34,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-01-01 22:54:34,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 93 states and 136 transitions. Complement of second has 7 states. [2019-01-01 22:54:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:54:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:54:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-01-01 22:54:34,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 22:54:34,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:54:34,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 22:54:34,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:54:34,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 22:54:34,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:54:34,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2019-01-01 22:54:34,716 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:34,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2019-01-01 22:54:34,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:54:34,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:54:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2019-01-01 22:54:34,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:54:34,724 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-01 22:54:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2019-01-01 22:54:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 22:54:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:54:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-01 22:54:34,752 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-01 22:54:34,752 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-01 22:54:34,752 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:54:34,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-01 22:54:34,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:34,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:34,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:34,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:54:34,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:54:34,755 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 191#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 192#L17-3 assume !(init_~i~0 < 2); 205#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 189#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 190#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 204#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 195#L25-3 [2019-01-01 22:54:34,755 INFO L796 eck$LassoCheckResult]: Loop: 195#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 196#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 200#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 195#L25-3 [2019-01-01 22:54:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2019-01-01 22:54:34,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:34,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:34,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:34,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:54:34,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:54:34,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:54:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2019-01-01 22:54:34,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:34,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:54:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:54:35,017 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 22:54:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:54:35,048 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-01-01 22:54:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:54:35,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-01-01 22:54:35,051 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:35,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2019-01-01 22:54:35,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:54:35,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:54:35,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-01 22:54:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:54:35,053 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-01 22:54:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-01 22:54:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-01 22:54:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:54:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 22:54:35,057 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:54:35,057 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:54:35,057 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:54:35,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 22:54:35,058 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:35,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:35,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:35,059 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:54:35,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:54:35,059 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 254#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 255#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 268#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 269#L17-3 assume !(init_~i~0 < 2); 270#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 252#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 253#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 267#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 256#L25-3 [2019-01-01 22:54:35,060 INFO L796 eck$LassoCheckResult]: Loop: 256#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 257#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 264#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 256#L25-3 [2019-01-01 22:54:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2019-01-01 22:54:35,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:35,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:54:35,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:54:35,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:35,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:54:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:35,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:54:35,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 22:54:35,303 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:54:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2019-01-01 22:54:35,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,462 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 22:54:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:54:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:54:35,505 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:54:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:54:35,529 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-01 22:54:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:54:35,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-01 22:54:35,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:35,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-01-01 22:54:35,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:54:35,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:54:35,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-01-01 22:54:35,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:54:35,534 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-01 22:54:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-01-01 22:54:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 22:54:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 22:54:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-01 22:54:35,539 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-01 22:54:35,539 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-01 22:54:35,539 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:54:35,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-01-01 22:54:35,540 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:54:35,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:35,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:35,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:54:35,541 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:54:35,543 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 344#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 345#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 358#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 359#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 370#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 371#L17-3 assume !(init_~i~0 < 2); 360#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 342#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 343#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 357#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 346#L25-3 [2019-01-01 22:54:35,544 INFO L796 eck$LassoCheckResult]: Loop: 346#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 354#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 346#L25-3 [2019-01-01 22:54:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2019-01-01 22:54:35,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:35,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:54:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2019-01-01 22:54:35,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:35,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:54:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2019-01-01 22:54:35,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:35,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:54:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:35,888 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 22:54:36,300 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-01-01 22:54:36,563 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 22:54:37,056 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-01-01 22:54:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:54:37,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:54:37,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:54:37,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:54:37,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-01 22:54:37,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 22:54:37,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-01 22:54:37,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-01 22:54:37,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 22:54:37,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-01 22:54:37,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:54:37,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-01 22:54:37,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 22:54:37,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-01 22:54:37,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:54:37,478 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,482 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,543 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2019-01-01 22:54:37,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-01 22:54:37,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:54:37,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 22:54:37,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 22:54:37,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:54:37,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-01 22:54:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:54:37,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 22:54:37,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 22:54:37,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:54:37,867 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:37,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:54:37,921 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2019-01-01 22:54:38,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-01 22:54:38,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:54:38,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-01 22:54:38,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:38,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:38,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-01 22:54:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:54:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-01 22:54:38,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:54:38,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:38,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:54:38,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2019-01-01 22:54:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:54:38,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:54:38,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-01 22:54:38,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 22:54:38,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-01-01 22:54:38,464 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 19 states. [2019-01-01 22:54:38,861 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-01-01 22:54:39,635 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-01-01 22:54:40,130 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-01-01 22:54:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:54:40,291 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-01 22:54:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:54:40,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-01-01 22:54:40,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 22:54:40,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2019-01-01 22:54:40,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:54:40,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 22:54:40,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-01 22:54:40,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:54:40,296 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 22:54:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-01 22:54:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 22:54:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 22:54:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-01 22:54:40,301 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 22:54:40,301 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 22:54:40,301 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:54:40,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2019-01-01 22:54:40,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 22:54:40,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:54:40,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:54:40,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:54:40,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:54:40,304 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 482#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 483#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 496#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 497#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 507#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 508#L17-3 assume !(init_~i~0 < 2); 495#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 480#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 481#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 494#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 484#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 485#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 490#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 491#L25-7 [2019-01-01 22:54:40,304 INFO L796 eck$LassoCheckResult]: Loop: 491#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 502#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 504#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 491#L25-7 [2019-01-01 22:54:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2019-01-01 22:54:40,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:40,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:40,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2019-01-01 22:54:40,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:40,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:54:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2019-01-01 22:54:40,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:54:40,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:54:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:54:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:54:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:54:40,713 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 22:54:40,880 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 22:55:12,242 WARN L181 SmtUtils]: Spent 31.36 s on a formula simplification. DAG size of input: 268 DAG size of output: 227 [2019-01-01 22:55:12,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:12,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:26,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:26,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:39,914 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:40,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:54,395 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:55:54,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:07,762 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:08,006 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:21,887 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:22,144 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:31,176 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:31,370 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:39,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-01 22:56:39,331 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:467, output treesize:1770 [2019-01-01 22:56:47,956 WARN L181 SmtUtils]: Spent 8.62 s on a formula simplification that was a NOOP. DAG size: 161 [2019-01-01 22:56:47,959 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:56:47,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:56:47,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:56:47,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:56:47,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:56:47,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:56:47,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:56:47,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:56:47,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2019-01-01 22:56:47,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:56:47,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:56:47,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:47,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:48,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,307 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-01-01 22:56:49,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:56:49,897 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:56:49,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:56:49,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:56:49,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:56:49,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:56:49,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:56:49,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:56:49,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:56:49,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:56:49,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:56:49,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:56:49,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:49,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:49,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:49,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:49,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:49,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:49,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:49,997 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:56:49,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:49,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:50,001 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:56:50,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:50,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:50,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:50,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:50,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:50,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:50,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:50,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:50,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:50,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:50,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:50,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:50,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:56:50,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:50,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:50,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:50,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:56:50,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:56:50,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:50,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:50,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:50,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:50,023 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 22:56:50,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:50,039 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2019-01-01 22:56:50,040 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 22:56:50,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:56:50,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:56:50,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:56:50,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:56:50,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:56:50,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:56:50,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:56:50,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:56:50,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:56:50,105 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:56:50,105 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:56:50,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:56:50,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:56:50,108 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:56:50,108 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2019-01-01 22:56:50,344 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 22:56:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:50,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:56:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:50,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:56:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:56:50,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:56:50,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:56:50,993 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 6 states. [2019-01-01 22:56:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:56:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:56:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-01-01 22:56:50,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 22:56:51,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:56:51,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 22:56:51,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:56:51,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 22:56:51,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:56:51,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2019-01-01 22:56:51,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-01 22:56:51,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2019-01-01 22:56:51,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 22:56:51,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 22:56:51,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-01-01 22:56:51,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:51,043 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 22:56:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-01-01 22:56:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-01-01 22:56:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 22:56:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-01-01 22:56:51,046 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-01 22:56:51,046 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-01 22:56:51,046 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:56:51,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-01-01 22:56:51,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:51,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:51,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:51,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:51,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:56:51,048 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 689#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 690#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 702#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 703#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 716#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 717#L17-3 assume !(init_~i~0 < 2); 704#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 687#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 688#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 701#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 693#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 694#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 697#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 698#L25-7 assume !(f_~i~1 < 2); 691#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 692#L36-3 [2019-01-01 22:56:51,049 INFO L796 eck$LassoCheckResult]: Loop: 692#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 696#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 700#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 692#L36-3 [2019-01-01 22:56:51,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:51,049 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2019-01-01 22:56:51,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:51,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:51,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:56:51,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:56:51,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:56:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2019-01-01 22:56:51,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:51,405 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:56:51,866 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 22:56:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:56:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:56:51,867 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 22:56:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:56:51,940 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-01 22:56:51,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:56:51,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-01 22:56:51,943 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-01 22:56:51,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-01 22:56:51,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-01 22:56:51,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-01 22:56:51,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-01 22:56:51,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:51,948 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 22:56:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-01 22:56:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-01-01 22:56:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 22:56:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-01 22:56:51,954 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 22:56:51,954 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 22:56:51,954 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:56:51,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-01-01 22:56:51,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:51,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:51,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:51,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:51,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:56:51,958 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 772#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 773#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 785#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 786#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 799#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 800#L17-3 assume !(init_~i~0 < 2); 787#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 770#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 771#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 784#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 774#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 775#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 780#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 781#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 793#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 776#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 777#L36-3 [2019-01-01 22:56:51,958 INFO L796 eck$LassoCheckResult]: Loop: 777#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 779#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 783#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 777#L36-3 [2019-01-01 22:56:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2019-01-01 22:56:51,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:51,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:56:52,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 22:56:52,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:56:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2019-01-01 22:56:52,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:52,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:52,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:56:52,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:56:52,455 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-01-01 22:56:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:56:52,823 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-01-01 22:56:52,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:56:52,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-01-01 22:56:52,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-01 22:56:52,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2019-01-01 22:56:52,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 22:56:52,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 22:56:52,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-01-01 22:56:52,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:52,827 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-01 22:56:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-01-01 22:56:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-01-01 22:56:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 22:56:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-01-01 22:56:52,831 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-01 22:56:52,833 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-01 22:56:52,833 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:56:52,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-01-01 22:56:52,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:52,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:52,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:52,835 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:52,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:56:52,837 INFO L794 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 875#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 876#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 888#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 889#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 902#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 903#L17-3 assume !(init_~i~0 < 2); 890#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 873#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 874#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 887#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 879#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 880#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 883#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 884#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 895#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 899#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 896#L25-7 assume !(f_~i~1 < 2); 877#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 878#L36-3 [2019-01-01 22:56:52,837 INFO L796 eck$LassoCheckResult]: Loop: 878#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 882#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 886#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 878#L36-3 [2019-01-01 22:56:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2019-01-01 22:56:52,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:52,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:56:52,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:52,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:56:52,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:56:52,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:52,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:56:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:53,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:56:53,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 22:56:53,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:56:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2019-01-01 22:56:53,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,220 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:56:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:56:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:56:53,252 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 22:56:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:56:53,280 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-01 22:56:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:56:53,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-01 22:56:53,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-01 22:56:53,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-01 22:56:53,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 22:56:53,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 22:56:53,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-01 22:56:53,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:53,288 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 22:56:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-01 22:56:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-01-01 22:56:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:56:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-01-01 22:56:53,298 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-01-01 22:56:53,298 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-01-01 22:56:53,298 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:56:53,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-01-01 22:56:53,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:53,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:53,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:53,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:53,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:56:53,302 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1014#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1015#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1027#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1028#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1042#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1044#L17-3 assume !(init_~i~0 < 2); 1029#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1012#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1013#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1026#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1016#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1017#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1022#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1023#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1034#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1039#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1035#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1036#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1018#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1019#L36-3 [2019-01-01 22:56:53,302 INFO L796 eck$LassoCheckResult]: Loop: 1019#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1021#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1025#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1019#L36-3 [2019-01-01 22:56:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2019-01-01 22:56:53,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:53,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:56:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2019-01-01 22:56:53,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:53,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2019-01-01 22:56:53,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:56:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:53,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:56:53,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:56:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:53,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:56:54,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-01 22:56:54,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 22:56:54,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-01 22:56:54,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-01 22:56:54,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:56:54,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 22:56:54,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-01 22:56:54,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-01 22:56:54,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:56:54,354 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 22:56:54,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-01 22:56:54,388 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,396 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,408 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:76, output treesize:28 [2019-01-01 22:56:54,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-01 22:56:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:56:54,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 22:56:54,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 22:56:54,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:56:54,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-01 22:56:54,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:56:54,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 22:56:54,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-01 22:56:54,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:56:54,644 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,651 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,678 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:125, output treesize:24 [2019-01-01 22:56:54,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:56:54,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:56:54,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:56:54,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:56:54,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:54,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2019-01-01 22:56:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:56:54,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2019-01-01 22:56:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 22:56:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-01 22:56:54,969 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-01-01 22:56:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:56:55,357 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-01-01 22:56:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:56:55,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2019-01-01 22:56:55,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:55,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2019-01-01 22:56:55,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 22:56:55,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 22:56:55,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-01-01 22:56:55,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:55,361 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-01-01 22:56:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-01-01 22:56:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-01 22:56:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 22:56:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-01-01 22:56:55,366 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-01 22:56:55,366 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-01 22:56:55,366 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:56:55,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2019-01-01 22:56:55,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 22:56:55,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:55,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:55,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:55,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:56:55,368 INFO L794 eck$LassoCheckResult]: Stem: 1207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1179#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1180#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1208#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1209#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1193#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1194#L17-3 assume !(init_~i~0 < 2); 1195#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1177#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1178#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1192#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1183#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1184#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1186#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1187#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1200#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1205#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1201#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1202#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1181#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1182#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1185#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1196#L39 [2019-01-01 22:56:55,368 INFO L796 eck$LassoCheckResult]: Loop: 1196#L39 assume 1 == g_#t~mem5; 1199#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1188#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1189#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1210#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1196#L39 [2019-01-01 22:56:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2019-01-01 22:56:55,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:55,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:55,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2019-01-01 22:56:55,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:56:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2019-01-01 22:56:55,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:55,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:55,976 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-01-01 22:56:56,162 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-01 22:56:56,546 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-01-01 22:56:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:56,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:56:56,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:56:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:56:56,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:56:56,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-01 22:56:56,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 22:56:56,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:56,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:56,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:56,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-01 22:56:57,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 22:56:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:56:57,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 22:56:57,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-01 22:56:57,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2019-01-01 22:56:57,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2019-01-01 22:56:57,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:56:57,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-01-01 22:56:57,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:56:57,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:56:57,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:56:57,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-01 22:56:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:56:57,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:56:57,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2019-01-01 22:56:57,557 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-01 22:56:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 22:56:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2019-01-01 22:56:57,607 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 26 states. [2019-01-01 22:56:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:56:59,588 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-01-01 22:56:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 22:56:59,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2019-01-01 22:56:59,591 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2019-01-01 22:56:59,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2019-01-01 22:56:59,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-01-01 22:56:59,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-01-01 22:56:59,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2019-01-01 22:56:59,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:56:59,594 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-01-01 22:56:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2019-01-01 22:56:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-01-01 22:56:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 22:56:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-01-01 22:56:59,602 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-01 22:56:59,602 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-01 22:56:59,602 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:56:59,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-01-01 22:56:59,605 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 22:56:59,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:56:59,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:56:59,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:56:59,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:56:59,607 INFO L794 eck$LassoCheckResult]: Stem: 1465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1434#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1435#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1448#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1449#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1466#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1468#L17-3 assume !(init_~i~0 < 2); 1450#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1432#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1433#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1447#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1436#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1437#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1441#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1442#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1457#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1473#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1458#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1460#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1462#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1463#L25-7 assume !(f_~i~1 < 2); 1471#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1478#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1477#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1476#L39 [2019-01-01 22:56:59,607 INFO L796 eck$LassoCheckResult]: Loop: 1476#L39 assume 1 == g_#t~mem5; 1474#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1445#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1446#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1475#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1476#L39 [2019-01-01 22:56:59,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:56:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2019-01-01 22:56:59,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:56:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:56:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:59,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:56:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:56:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:00,004 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2019-01-01 22:57:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:57:00,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:00,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:57:00,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:00,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:00,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-01 22:57:00,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-01 22:57:00,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-01 22:57:00,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 22:57:00,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:57:00,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 22:57:00,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-01 22:57:00,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 22:57:00,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:57:00,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 22:57:00,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-01 22:57:00,721 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,738 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2019-01-01 22:57:00,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2019-01-01 22:57:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:00,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 22:57:00,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2019-01-01 22:57:00,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:57:00,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2019-01-01 22:57:00,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:00,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 22:57:00,972 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:00,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2019-01-01 22:57:00,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-01 22:57:00,999 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,040 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2019-01-01 22:57:01,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:57:01,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:57:01,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:57:01,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:57:01,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:01,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-01 22:57:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:01,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:01,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2019-01-01 22:57:01,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2019-01-01 22:57:01,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:01,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:01,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:01,516 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-01 22:57:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 22:57:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-01 22:57:01,567 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 22 states. [2019-01-01 22:57:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:02,484 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-01 22:57:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 22:57:02,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-01-01 22:57:02,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:57:02,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2019-01-01 22:57:02,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:57:02,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 22:57:02,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-01-01 22:57:02,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:02,488 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-01 22:57:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-01-01 22:57:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-01 22:57:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 22:57:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-01-01 22:57:02,490 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-01 22:57:02,490 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-01 22:57:02,491 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:57:02,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2019-01-01 22:57:02,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:57:02,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:02,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:02,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:02,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:02,492 INFO L794 eck$LassoCheckResult]: Stem: 1665#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1639#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1640#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1653#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1654#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1666#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1671#L17-3 assume !(init_~i~0 < 2); 1655#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1637#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1638#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1652#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1641#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1642#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1646#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1647#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1660#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1662#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1663#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1667#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1643#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1644#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1645#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1656#L39 assume 1 == g_#t~mem5; 1659#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1648#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1649#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1669#L37 [2019-01-01 22:57:02,492 INFO L796 eck$LassoCheckResult]: Loop: 1669#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1670#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1668#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1669#L37 [2019-01-01 22:57:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2019-01-01 22:57:02,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2019-01-01 22:57:02,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:02,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2019-01-01 22:57:02,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:02,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 22:57:02,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:02,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:57:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:02,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 22:57:02,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:57:02,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-01 22:57:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:57:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:57:02,809 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-01-01 22:57:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:02,880 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-01 22:57:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:57:02,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-01-01 22:57:02,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:02,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-01 22:57:02,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:57:02,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:57:02,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:57:02,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:02,883 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:02,884 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:02,884 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:02,884 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:57:02,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:57:02,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:02,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:57:02,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:57:02 BoogieIcfgContainer [2019-01-01 22:57:02,891 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:57:02,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:57:02,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:57:02,892 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:57:02,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:54:31" (3/4) ... [2019-01-01 22:57:02,897 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:57:02,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:57:02,898 INFO L168 Benchmark]: Toolchain (without parser) took 152904.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 943.3 MB in the beginning and 896.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,898 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:02,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.46 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,899 INFO L168 Benchmark]: Boogie Preprocessor took 99.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,900 INFO L168 Benchmark]: RCFGBuilder took 634.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,900 INFO L168 Benchmark]: BuchiAutomizer took 151805.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 896.3 MB in the end (delta: 181.1 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:02,900 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 896.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:02,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.46 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 634.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 151805.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 896.3 MB in the end (delta: 181.1 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 896.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[pp] + -3 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 151.7s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 144.7s. Construction of modules took 1.9s. Büchi inclusion checks took 4.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 288 SDtfs, 836 SDslu, 799 SDs, 0 SdLazy, 1195 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1082 mio100 ax100 hnf100 lsp96 ukn24 mio100 lsp45 div100 bol100 ite100 ukn100 eq169 hnf77 smp100 dnf100 smp100 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...