./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/stroeder2-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 6b0415ceba0811795bdd9d25bfbda379c533d6bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:53:47,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:53:47,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:53:47,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:53:47,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:53:47,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:53:47,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:53:47,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:53:47,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:53:47,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:53:47,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:53:47,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:53:47,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:53:47,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:53:47,658 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:53:47,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:53:47,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:53:47,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:53:47,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:53:47,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:53:47,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:53:47,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:53:47,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:53:47,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:53:47,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:53:47,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:53:47,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:53:47,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:53:47,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:53:47,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:53:47,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:53:47,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:53:47,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:53:47,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:53:47,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:53:47,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:53:47,697 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:53:47,718 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:53:47,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:53:47,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:53:47,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:53:47,720 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:53:47,720 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:53:47,720 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:53:47,720 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:53:47,720 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:53:47,721 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:53:47,721 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:53:47,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:53:47,721 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:53:47,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:53:47,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:53:47,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:53:47,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:53:47,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:53:47,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:53:47,724 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:53:47,724 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:53:47,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:53:47,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:53:47,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:53:47,725 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:53:47,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:53:47,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:53:47,726 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:53:47,727 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:53:47,728 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0415ceba0811795bdd9d25bfbda379c533d6bc [2019-01-01 21:53:47,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:53:47,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:53:47,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:53:47,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:53:47,805 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:53:47,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2019-01-01 21:53:47,862 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac5db0c/34551d0b5d884444add99e731a0ccb87/FLAGd4d6195a1 [2019-01-01 21:53:48,417 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:53:48,422 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2019-01-01 21:53:48,435 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac5db0c/34551d0b5d884444add99e731a0ccb87/FLAGd4d6195a1 [2019-01-01 21:53:48,650 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac5db0c/34551d0b5d884444add99e731a0ccb87 [2019-01-01 21:53:48,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:53:48,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:53:48,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:48,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:53:48,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:53:48,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:48" (1/1) ... [2019-01-01 21:53:48,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7055dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:48, skipping insertion in model container [2019-01-01 21:53:48,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:48" (1/1) ... [2019-01-01 21:53:48,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:53:48,719 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:53:49,132 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:49,148 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:53:49,287 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:49,347 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:53:49,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49 WrapperNode [2019-01-01 21:53:49,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:49,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:49,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:53:49,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:53:49,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:49,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:53:49,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:53:49,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:53:49,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (1/1) ... [2019-01-01 21:53:49,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:53:49,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:53:49,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:53:49,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:53:49,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (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 21:53:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:53:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:53:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:53:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:53:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:53:49,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:53:49,866 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:53:49,866 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:53:49,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:49 BoogieIcfgContainer [2019-01-01 21:53:49,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:53:49,868 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:53:49,868 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:53:49,871 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:53:49,872 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:49,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:53:48" (1/3) ... [2019-01-01 21:53:49,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2010758f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:49, skipping insertion in model container [2019-01-01 21:53:49,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:49,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:49" (2/3) ... [2019-01-01 21:53:49,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2010758f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:49, skipping insertion in model container [2019-01-01 21:53:49,875 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:49,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:49" (3/3) ... [2019-01-01 21:53:49,877 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-termination.c.i [2019-01-01 21:53:49,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:53:49,937 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:53:49,938 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:53:49,938 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:53:49,938 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:53:49,938 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:53:49,938 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:53:49,939 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:53:49,939 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:53:49,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:53:49,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:49,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:49,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:49,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:49,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:49,985 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:53:49,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:53:49,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:49,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:49,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:49,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:49,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:49,997 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L564true assume !(main_~array_size~0 < 1); 10#L564-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 15#L552-3true [2019-01-01 21:53:49,997 INFO L796 eck$LassoCheckResult]: Loop: 15#L552-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 9#L555-3true assume !true; 12#L552-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 15#L552-3true [2019-01-01 21:53:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:53:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-01 21:53:50,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:50,211 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 21:53:50,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:53:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:53:50,216 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:53:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:53:50,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:53:50,238 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-01 21:53:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:53:50,246 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-01 21:53:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:53:50,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-01 21:53:50,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:50,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-01 21:53:50,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:53:50,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:53:50,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-01 21:53:50,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:50,258 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:53:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-01 21:53:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:53:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:53:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-01 21:53:50,291 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:53:50,291 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:53:50,291 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:53:50,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-01 21:53:50,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:53:50,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:50,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:50,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:50,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:50,294 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L564 assume !(main_~array_size~0 < 1); 36#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 40#L552-3 [2019-01-01 21:53:50,294 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 38#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 41#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 40#L552-3 [2019-01-01 21:53:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-01 21:53:50,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-01 21:53:50,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-01 21:53:50,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,949 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:53:51,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:51,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:51,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:51,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:51,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:51,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:51,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:51,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:51,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:53:51,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:51,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:51,078 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 21:53:51,302 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:53:51,336 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 21:53:51,357 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 21:53:51,359 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 21:53:51,360 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 21:53:51,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 21:53:51,383 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 21:53:51,387 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 21:53:51,391 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 21:53:51,401 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 21:53:51,404 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 21:53:51,406 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 21:53:51,410 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 21:53:51,430 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 21:53:51,460 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 21:53:51,471 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 21:53:51,882 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 21:53:52,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:52,320 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:52,322 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 21:53:52,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:52,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:52,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:52,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:52,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:52,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:52,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:52,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:52,331 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 21:53:52,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:52,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:52,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:52,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:52,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:52,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:52,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:52,341 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 21:53:52,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:52,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:52,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:52,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:52,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:52,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:52,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:52,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:52,350 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 21:53:52,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:52,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:52,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:52,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:52,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:52,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:52,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:52,359 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 21:53:52,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:52,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:52,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:52,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:52,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:52,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:52,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:52,504 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:53:52,505 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:53:52,508 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:52,510 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:52,518 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:52,518 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-01-01 21:53:52,529 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:53:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:52,638 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 21:53:52,642 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 21:53:52,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:53:52,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-01 21:53:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:53:52,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:53:52,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:53:52,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:53:52,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-01 21:53:52,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:53:52,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-01 21:53:52,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:53:52,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:53:52,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:53:52,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:52,724 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:53:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:53:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 21:53:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:53:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 21:53:52,727 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:53:52,727 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:53:52,727 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:53:52,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 21:53:52,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:53:52,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:52,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:52,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:53:52,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:53:52,730 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L564 assume !(main_~array_size~0 < 1); 105#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 111#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L555-3 [2019-01-01 21:53:52,730 INFO L796 eck$LassoCheckResult]: Loop: 107#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 108#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 107#L555-3 [2019-01-01 21:53:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-01 21:53:52,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-01 21:53:52,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:52,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-01 21:53:52,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:52,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,163 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 21:53:53,366 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 21:53:53,385 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:53,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:53,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:53,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:53,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:53,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:53,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:53,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:53,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:53:53,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:53,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:53,391 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 21:53:53,396 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 21:53:53,402 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 21:53:53,405 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 21:53:53,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 21:53:53,431 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 21:53:53,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 21:53:53,439 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 21:53:53,441 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 21:53:53,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 21:53:53,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 21:53:53,630 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 21:53:53,688 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 21:53:53,692 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 21:53:53,695 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 21:53:53,698 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 21:53:53,701 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 21:53:54,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:54,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:54,184 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 21:53:54,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,191 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 21:53:54,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,197 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 21:53:54,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,202 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 21:53:54,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:54,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,214 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 21:53:54,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,218 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 21:53:54,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:54,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,232 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 21:53:54,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,238 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 21:53:54,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,247 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 21:53:54,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:54,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,257 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 21:53:54,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,267 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 21:53:54,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,267 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:53:54,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,274 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:53:54,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,311 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 21:53:54,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,319 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:54,320 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:53:54,324 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:53:54,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:54,324 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:53:54,325 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:54,325 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-01-01 21:53:54,378 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:53:54,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:53:54,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:54,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:54,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:54,585 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 21:53:54,585 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 21:53:54,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:53:54,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2019-01-01 21:53:54,664 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 21:53:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:53:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:53:54,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:54,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:53:54,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:54,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:53:54,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:54,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-01-01 21:53:54,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:53:54,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2019-01-01 21:53:54,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:53:54,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:53:54,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-01 21:53:54,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:54,669 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-01 21:53:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-01 21:53:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-01 21:53:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:53:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-01 21:53:54,672 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:53:54,672 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:53:54,672 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:53:54,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-01 21:53:54,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:53:54,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:54,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:54,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:53:54,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:53:54,673 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L564 assume !(main_~array_size~0 < 1); 195#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 201#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 204#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 205#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 202#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 203#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 197#L555-3 [2019-01-01 21:53:54,674 INFO L796 eck$LassoCheckResult]: Loop: 197#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 198#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 197#L555-3 [2019-01-01 21:53:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-01 21:53:54,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:54,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-01 21:53:54,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:54,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-01 21:53:54,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:54,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:54,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:54,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:55,290 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-01-01 21:53:55,379 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:55,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:55,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:55,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:55,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:55,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:55,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:55,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:55,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:53:55,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:55,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:55,384 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 21:53:55,388 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 21:53:55,390 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 21:53:55,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 21:53:55,395 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 21:53:55,400 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 21:53:55,408 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 21:53:55,535 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-01 21:53:55,557 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 21:53:55,573 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 21:53:55,575 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 21:53:55,578 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 21:53:55,581 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 21:53:55,582 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 21:53:55,584 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 21:53:55,586 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 21:53:55,588 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 21:53:55,788 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 21:53:56,137 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 21:53:56,180 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:56,180 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:56,180 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 21:53:56,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:56,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:56,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:56,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,187 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 21:53:56,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:56,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:56,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,195 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 21:53:56,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:56,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:56,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:56,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,200 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 21:53:56,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:56,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:56,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,212 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 21:53:56,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:56,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:56,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:56,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,218 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 21:53:56,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:56,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:56,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:56,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,225 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 21:53:56,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:56,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:56,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,236 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 21:53:56,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:56,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:56,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:56,255 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 21:53:56,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:56,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:56,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:56,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:56,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:56,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:56,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:56,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:56,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:53:56,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:53:56,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:56,264 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:53:56,266 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:56,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-01-01 21:53:56,389 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-01 21:53:56,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:53:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,514 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 21:53:56,514 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 21:53:56,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:53:56,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-01 21:53:56,537 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 21:53:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:53:56,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:53:56,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:56,539 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,614 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 21:53:56,615 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:53:56,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:53:56,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-01 21:53:56,646 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 21:53:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:53:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:53:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:56,647 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:56,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:56,707 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 21:53:56,708 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:53:56,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:53:56,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-01-01 21:53:56,729 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 21:53:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:53:56,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:53:56,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:56,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:53:56,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:56,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:53:56,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:56,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-01 21:53:56,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:56,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:53:56,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:53:56,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:56,738 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:53:56,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:53:56,738 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:56,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:53:56,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:53:56 BoogieIcfgContainer [2019-01-01 21:53:56,746 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:53:56,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:53:56,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:53:56,747 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:53:56,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:49" (3/4) ... [2019-01-01 21:53:56,753 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:53:56,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:53:56,754 INFO L168 Benchmark]: Toolchain (without parser) took 8099.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 948.7 MB in the beginning and 996.2 MB in the end (delta: -47.5 MB). Peak memory consumption was 168.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:56,755 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:56,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:56,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:56,759 INFO L168 Benchmark]: Boogie Preprocessor took 37.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:56,759 INFO L168 Benchmark]: RCFGBuilder took 415.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:56,760 INFO L168 Benchmark]: BuchiAutomizer took 6878.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 996.2 MB in the end (delta: 106.9 MB). Peak memory consumption was 181.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:56,763 INFO L168 Benchmark]: Witness Printer took 7.38 ms. Allocated memory is still 1.2 GB. Free memory is still 996.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:56,768 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 692.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 415.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6878.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 996.2 MB in the end (delta: 106.9 MB). Peak memory consumption was 181.9 MB. Max. memory is 11.5 GB. * Witness Printer took 7.38 ms. Allocated memory is still 1.2 GB. Free memory is still 996.2 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax113 hnf99 lsp79 ukn83 mio100 lsp56 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...