./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 91b1670e 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-91b1670 [2018-11-28 23:21:41,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:41,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:41,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:41,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:41,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:41,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:41,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:41,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:41,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:41,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:41,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:41,118 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:41,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:41,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:41,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:41,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:41,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:41,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:41,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:41,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:41,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:41,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:41,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:41,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:41,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:41,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:41,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:41,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:41,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:41,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:41,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:41,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:41,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:41,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:41,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:41,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:41,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:41,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:41,172 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:41,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:41,172 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:41,172 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:41,173 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:41,173 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:41,173 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:41,173 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:41,173 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:41,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:41,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:41,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:41,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:41,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:41,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:41,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:41,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:41,175 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:41,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:41,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:41,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:41,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:41,176 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:41,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:41,176 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:41,176 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:41,177 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:41,177 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 [2018-11-28 23:21:41,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:41,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:41,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:41,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:41,260 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:41,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-11-28 23:21:41,325 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313c4f385/c62b83789a4e4257ac6e473f4c63c3d8/FLAG73a2e59a5 [2018-11-28 23:21:41,818 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:41,818 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-11-28 23:21:41,835 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313c4f385/c62b83789a4e4257ac6e473f4c63c3d8/FLAG73a2e59a5 [2018-11-28 23:21:42,122 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313c4f385/c62b83789a4e4257ac6e473f4c63c3d8 [2018-11-28 23:21:42,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:42,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:42,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:42,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:42,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:42,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e1a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42, skipping insertion in model container [2018-11-28 23:21:42,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:42,198 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:42,566 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:42,589 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:42,655 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:42,795 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:42,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42 WrapperNode [2018-11-28 23:21:42,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:42,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:42,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:42,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:42,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:42,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:42,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:42,860 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:42,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (1/1) ... [2018-11-28 23:21:42,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:42,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:42,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:42,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:42,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (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 [2018-11-28 23:21:42,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:42,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:42,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:42,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:42,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:42,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:43,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:43,322 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:43,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:43 BoogieIcfgContainer [2018-11-28 23:21:43,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:43,323 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:43,324 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:43,327 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:43,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:43,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:42" (1/3) ... [2018-11-28 23:21:43,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7927c60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:43, skipping insertion in model container [2018-11-28 23:21:43,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:43,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:42" (2/3) ... [2018-11-28 23:21:43,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7927c60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:43, skipping insertion in model container [2018-11-28 23:21:43,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:43,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:43" (3/3) ... [2018-11-28 23:21:43,332 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-termination.c.i [2018-11-28 23:21:43,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:43,392 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:43,392 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:43,392 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:43,393 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:43,393 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:43,393 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:43,393 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:43,393 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:43,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:21:43,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:43,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:43,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:43,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:21:43,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:43,436 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:43,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:21:43,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:43,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:43,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:43,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:21:43,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:43,447 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.alloc(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 [2018-11-28 23:21:43,447 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 [2018-11-28 23:21:43,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:21:43,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-28 23:21:43,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:43,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:43,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:43,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:43,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:21:43,631 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:21:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:21:43,649 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-28 23:21:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:43,657 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-28 23:21:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:21:43,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-28 23:21:43,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:43,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-28 23:21:43,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:21:43,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:21:43,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 23:21:43,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:43,668 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:21:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 23:21:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-28 23:21:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:21:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 23:21:43,699 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:21:43,700 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:21:43,700 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:43,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 23:21:43,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:43,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:43,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:43,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:21:43,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:43,702 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.alloc(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 [2018-11-28 23:21:43,702 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 [2018-11-28 23:21:43,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:21:43,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-28 23:21:43,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:43,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-28 23:21:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:43,960 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:21:44,360 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:21:44,433 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:44,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:44,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:44,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:44,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:44,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:44,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:44,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:44,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:44,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:44,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,717 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:21:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:44,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:45,328 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:21:45,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:45,636 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:45,639 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 [2018-11-28 23:21:45,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:45,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:45,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:45,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,648 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 [2018-11-28 23:21:45,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:45,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:45,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:45,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,651 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 [2018-11-28 23:21:45,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:45,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:45,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:45,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,654 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 [2018-11-28 23:21:45,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:45,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:45,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,662 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 [2018-11-28 23:21:45,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:45,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:45,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:45,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,666 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 [2018-11-28 23:21:45,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:45,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:45,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,675 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 [2018-11-28 23:21:45,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,676 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:45,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,681 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:45,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:45,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,706 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 [2018-11-28 23:21:45,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:45,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:45,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:45,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,711 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 [2018-11-28 23:21:45,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:45,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:45,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:45,718 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 [2018-11-28 23:21:45,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:45,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:45,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:45,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:45,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:45,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:45,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:45,837 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:45,837 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:45,840 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:45,841 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:45,842 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:45,842 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 [] [2018-11-28 23:21:45,869 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:21:45,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:45,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:45,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:46,011 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 [2018-11-28 23:21:46,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:21:46,075 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. [2018-11-28 23:21:46,078 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 [2018-11-28 23:21:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:21:46,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:21:46,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:46,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:21:46,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:46,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 23:21:46,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:46,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-28 23:21:46,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:46,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-28 23:21:46,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:21:46,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:21:46,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 23:21:46,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:46,088 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:21:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 23:21:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 23:21:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:21:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 23:21:46,090 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:21:46,090 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:21:46,091 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:46,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 23:21:46,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:46,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:46,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:46,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:46,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:21:46,092 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.alloc(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 [2018-11-28 23:21:46,093 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 [2018-11-28 23:21:46,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 23:21:46,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:46,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-28 23:21:46,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 23:21:46,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:46,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:46,444 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-11-28 23:21:46,713 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 23:21:46,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:46,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:46,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:46,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:46,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:46,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:46,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:46,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:46,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:21:46,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:46,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:46,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:46,968 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-11-28 23:21:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:47,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:47,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:47,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:47,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:47,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:47,462 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:47,463 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 [2018-11-28 23:21:47,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,466 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 [2018-11-28 23:21:47,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,469 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 [2018-11-28 23:21:47,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,471 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 [2018-11-28 23:21:47,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:47,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:47,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,476 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 [2018-11-28 23:21:47,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,479 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 [2018-11-28 23:21:47,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:47,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:47,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,497 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 [2018-11-28 23:21:47,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,504 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 [2018-11-28 23:21:47,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,511 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 [2018-11-28 23:21:47,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:47,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:47,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,525 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 [2018-11-28 23:21:47,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:47,534 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 [2018-11-28 23:21:47,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:47,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:47,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:47,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:47,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:47,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:47,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:47,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:47,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:21:47,556 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:47,556 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:47,556 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:21:47,557 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:47,557 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 [] [2018-11-28 23:21:47,641 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:21:47,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:21:47,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:47,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:47,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:48,153 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 [2018-11-28 23:21:48,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:21:48,189 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. [2018-11-28 23:21:48,190 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 [2018-11-28 23:21:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:21:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:21:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:21:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:21:48,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:48,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-11-28 23:21:48,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:48,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-11-28 23:21:48,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:21:48,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:21:48,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 23:21:48,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:48,195 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 23:21:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 23:21:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 23:21:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:21:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-28 23:21:48,198 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:21:48,198 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-28 23:21:48,198 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:21:48,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-28 23:21:48,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:48,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:48,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:48,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:48,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:21:48,201 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.alloc(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 [2018-11-28 23:21:48,201 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 [2018-11-28 23:21:48,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-28 23:21:48,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:48,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:48,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-28 23:21:48,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-28 23:21:48,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:48,705 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-11-28 23:21:48,769 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:48,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:48,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:48,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:48,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:48,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:48,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:48,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:48,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:21:48,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:48,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:48,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,940 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-28 23:21:48,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:48,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:49,261 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:21:49,519 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:49,519 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:49,519 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 [2018-11-28 23:21:49,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,523 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 [2018-11-28 23:21:49,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:49,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:49,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,527 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 [2018-11-28 23:21:49,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,530 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 [2018-11-28 23:21:49,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:49,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:49,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,538 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 [2018-11-28 23:21:49,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,541 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 [2018-11-28 23:21:49,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,543 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 [2018-11-28 23:21:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,546 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 [2018-11-28 23:21:49,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:49,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:49,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,554 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 [2018-11-28 23:21:49,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:49,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:49,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:49,577 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 [2018-11-28 23:21:49,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:49,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:49,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:49,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:49,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:49,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:49,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:49,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:49,585 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:21:49,585 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:49,585 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:49,585 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:21:49,586 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:49,586 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 [] [2018-11-28 23:21:49,721 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 23:21:49,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:21:49,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:50,103 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 [2018-11-28 23:21:50,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:21:50,130 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. [2018-11-28 23:21:50,131 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 [2018-11-28 23:21:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:21:50,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:21:50,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:50,132 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:21:50,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:50,217 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 [2018-11-28 23:21:50,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:21:50,234 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. [2018-11-28 23:21:50,236 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 [2018-11-28 23:21:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:21:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:21:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:50,237 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:21:50,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:50,293 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 [2018-11-28 23:21:50,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:21:50,315 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. [2018-11-28 23:21:50,315 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 [2018-11-28 23:21:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:21:50,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:21:50,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:50,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:21:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:21:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:50,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-28 23:21:50,320 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:50,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-28 23:21:50,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:21:50,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:21:50,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:21:50,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:50,321 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:50,321 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:50,321 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:50,321 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:21:50,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:21:50,322 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:50,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:21:50,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:50 BoogieIcfgContainer [2018-11-28 23:21:50,328 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:21:50,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:21:50,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:21:50,329 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:21:50,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:43" (3/4) ... [2018-11-28 23:21:50,333 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:21:50,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:21:50,334 INFO L168 Benchmark]: Toolchain (without parser) took 8208.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -59.8 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:50,336 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-28 23:21:50,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:50,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.36 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:50,338 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 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. [2018-11-28 23:21:50,338 INFO L168 Benchmark]: RCFGBuilder took 428.73 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:50,339 INFO L168 Benchmark]: BuchiAutomizer took 7004.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.2 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:50,340 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:21:50,345 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 667.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.36 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.23 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 428.73 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7004.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.2 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.0s. Büchi inclusion checks took 1.2s. 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.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax114 hnf99 lsp78 ukn82 mio100 lsp57 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 4 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...