./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 653582a7b000e4f324410c98077c6ee21baa5247 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:58:48,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:58:48,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:58:48,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:58:48,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:58:48,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:58:48,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:58:48,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:58:48,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:58:48,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:58:48,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:58:48,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:58:48,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:58:48,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:58:48,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:58:48,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:58:48,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:58:48,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:58:48,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:58:48,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:58:48,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:58:48,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:58:48,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:58:48,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:58:48,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:58:48,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:58:48,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:58:48,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:58:48,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:58:48,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:58:48,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:58:48,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:58:48,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:58:48,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:58:48,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:58:48,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:58:48,392 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:58:48,410 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:58:48,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:58:48,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:58:48,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:58:48,415 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:58:48,415 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:58:48,415 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:58:48,415 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:58:48,415 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:58:48,416 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:58:48,416 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:58:48,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:58:48,416 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:58:48,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:58:48,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:58:48,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:58:48,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:58:48,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:58:48,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:58:48,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:58:48,420 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:58:48,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:58:48,421 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:58:48,421 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:58:48,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:58:48,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:58:48,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:58:48,422 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:58:48,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:58:48,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:58:48,423 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:58:48,424 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:58:48,425 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 653582a7b000e4f324410c98077c6ee21baa5247 [2019-01-14 04:58:48,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:58:48,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:58:48,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:58:48,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:58:48,509 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:58:48,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:48,562 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44363f71/f9170b35501a43c5b7d007be4392b394/FLAG8a18007da [2019-01-14 04:58:49,072 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:58:49,073 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:49,084 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44363f71/f9170b35501a43c5b7d007be4392b394/FLAG8a18007da [2019-01-14 04:58:49,393 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44363f71/f9170b35501a43c5b7d007be4392b394 [2019-01-14 04:58:49,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:58:49,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:58:49,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:58:49,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:58:49,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:58:49,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:58:49" (1/1) ... [2019-01-14 04:58:49,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:49, skipping insertion in model container [2019-01-14 04:58:49,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:58:49" (1/1) ... [2019-01-14 04:58:49,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:58:49,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:58:49,880 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:58:49,896 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:58:50,030 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:58:50,096 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:58:50,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50 WrapperNode [2019-01-14 04:58:50,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:58:50,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:58:50,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:58:50,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:58:50,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:58:50,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:58:50,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:58:50,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:58:50,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... [2019-01-14 04:58:50,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:58:50,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:58:50,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:58:50,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:58:50,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:58:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:58:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:58:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:58:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:58:50,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:58:50,560 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:58:50,561 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:58:50,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:50 BoogieIcfgContainer [2019-01-14 04:58:50,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:58:50,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:58:50,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:58:50,567 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:58:50,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:50,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:58:49" (1/3) ... [2019-01-14 04:58:50,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43df7f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:58:50, skipping insertion in model container [2019-01-14 04:58:50,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:50,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:50" (2/3) ... [2019-01-14 04:58:50,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43df7f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:58:50, skipping insertion in model container [2019-01-14 04:58:50,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:50,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:50" (3/3) ... [2019-01-14 04:58:50,573 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:50,623 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:58:50,624 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:58:50,624 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:58:50,624 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:58:50,624 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:58:50,624 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:58:50,624 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:58:50,625 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:58:50,625 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:58:50,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:58:50,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:58:50,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:50,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:50,661 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:58:50,661 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:50,661 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:58:50,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:58:50,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:58:50,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:50,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:50,663 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:58:50,663 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:50,671 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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; 4#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L557-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 10#L545-3true [2019-01-14 04:58:50,672 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-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; 5#L548-3true assume !true; 7#L545-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 10#L545-3true [2019-01-14 04:58:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:58:50,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-14 04:58:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:50,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:58:50,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:58:50,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:58:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:58:50,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:58:50,854 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-14 04:58:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:58:50,861 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-14 04:58:50,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:58:50,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-14 04:58:50,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:58:50,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-14 04:58:50,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:58:50,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:58:50,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-14 04:58:50,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:58:50,872 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:58:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-14 04:58:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 04:58:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 04:58:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 04:58:50,901 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:58:50,901 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 04:58:50,901 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:58:50,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 04:58:50,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:58:50,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:50,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:50,903 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:58:50,903 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:58:50,904 INFO L794 eck$LassoCheckResult]: Stem: 38#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 36#L545-3 [2019-01-14 04:58:50,904 INFO L796 eck$LassoCheckResult]: Loop: 36#L545-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; 37#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 40#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 36#L545-3 [2019-01-14 04:58:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:58:50,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-14 04:58:50,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-14 04:58:50,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:51,485 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 04:58:51,611 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:51,613 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:51,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:51,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:51,618 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:51,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:51,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:51,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:51,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:58:51,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:51,619 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:51,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,814 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 04:58:51,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:51,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,356 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:58:52,694 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:52,700 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:52,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:52,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:52,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:52,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:52,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:52,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:52,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:52,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:52,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:52,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:52,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:52,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:52,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:52,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:52,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:52,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:52,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:52,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:52,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:52,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:52,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:52,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:52,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:52,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:52,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:52,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:52,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:52,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:52,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:52,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:52,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:52,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:52,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:52,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:52,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:52,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:52,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:52,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:52,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:52,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:52,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:52,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:52,888 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:58:52,889 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:58:52,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:52,894 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:52,894 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:52,895 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-01-14 04:58:52,923 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:58:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:53,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:53,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:53,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:53,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 04:58:53,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-14 04:58:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 04:58:53,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 04:58:53,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:53,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 04:58:53,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:53,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 04:58:53,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:53,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-14 04:58:53,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:58:53,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-14 04:58:53,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 04:58:53,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:58:53,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 04:58:53,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:53,092 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 04:58:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 04:58:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 04:58:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 04:58:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-14 04:58:53,095 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:58:53,095 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:58:53,095 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:58:53,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-14 04:58:53,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:58:53,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:53,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:53,098 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:58:53,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:58:53,098 INFO L794 eck$LassoCheckResult]: Stem: 112#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 105#L545-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#L548-3 [2019-01-14 04:58:53,099 INFO L796 eck$LassoCheckResult]: Loop: 107#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 109#L548-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#L548-3 [2019-01-14 04:58:53,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 04:58:53,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:53,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-14 04:58:53,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:53,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-14 04:58:53,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:53,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:53,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:53,273 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:58:53,706 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-14 04:58:53,793 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:53,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:53,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:53,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:53,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:53,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:53,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:53,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:53,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:58:53,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:53,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:53,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:54,026 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-14 04:58:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:54,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:54,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:54,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:54,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:54,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,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 [2019-01-14 04:58:54,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,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 [2019-01-14 04:58:54,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:54,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:54,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,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 [2019-01-14 04:58:54,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,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 [2019-01-14 04:58:54,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:54,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:54,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,500 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:58:54,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:58:54,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:54,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:54,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:54,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:54,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:54,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:54,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:54,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:54,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:54,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:54,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:54,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:58:54,564 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:58:54,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:54,564 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:58:54,565 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:54,565 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-01-14 04:58:54,643 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:58:54,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:58:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:54,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:54,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:54,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:54,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:58:54,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2019-01-14 04:58:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:58:54,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:58:54,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:54,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:58:54,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:54,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:58:54,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:54,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-01-14 04:58:54,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:58:54,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2019-01-14 04:58:54,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 04:58:54,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 04:58:54,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-14 04:58:54,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:54,893 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 04:58:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-14 04:58:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-14 04:58:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:58:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 04:58:54,898 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:58:54,898 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:58:54,898 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:58:54,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 04:58:54,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:58:54,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:54,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:54,900 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:58:54,900 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:58:54,901 INFO L794 eck$LassoCheckResult]: Stem: 200#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#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 195#L545-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; 196#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 206#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 205#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 197#L545-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; 199#L548-3 [2019-01-14 04:58:54,901 INFO L796 eck$LassoCheckResult]: Loop: 199#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 201#L548-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; 199#L548-3 [2019-01-14 04:58:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:54,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-14 04:58:54,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-14 04:58:54,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:54,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:54,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:54,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-14 04:58:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:54,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,095 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:58:55,378 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-01-14 04:58:55,448 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:55,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:55,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:55,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:55,449 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:55,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:55,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:55,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:55,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:58:55,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:55,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:55,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,687 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-14 04:58:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:55,907 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 04:58:56,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:56,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:56,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:56,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:56,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:56,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:56,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,266 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:56,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:58:56,268 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:58:56,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:56,269 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:58:56,269 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:56,269 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-01-14 04:58:56,303 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 04:58:56,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:58:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:56,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:56,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:58:56,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-14 04:58:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:58:56,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:58:56,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:56,466 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:58:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:56,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:56,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:58:56,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2019-01-14 04:58:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:58:56,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:58:56,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:56,546 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:58:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:56,595 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:56,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:58:56,625 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-01-14 04:58:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 04:58:56,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:58:56,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:56,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:58:56,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:56,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 04:58:56,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:56,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-14 04:58:56,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:56,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-14 04:58:56,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:58:56,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:58:56,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:58:56,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:58:56,631 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:56,631 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:56,631 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:56,631 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:58:56,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:58:56,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:56,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:58:56,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:58:56 BoogieIcfgContainer [2019-01-14 04:58:56,641 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:58:56,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:58:56,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:58:56,642 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:58:56,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:50" (3/4) ... [2019-01-14 04:58:56,646 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:58:56,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:58:56,647 INFO L168 Benchmark]: Toolchain (without parser) took 7249.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 952.7 MB in the beginning and 983.5 MB in the end (delta: -30.8 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:56,648 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:56,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:56,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:56,651 INFO L168 Benchmark]: Boogie Preprocessor took 29.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:56,652 INFO L168 Benchmark]: RCFGBuilder took 384.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:56,653 INFO L168 Benchmark]: BuchiAutomizer took 6078.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 983.5 MB in the end (delta: 83.9 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:56,654 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 983.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:56,659 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6078.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 983.5 MB in the end (delta: 83.9 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.2 GB. Free memory is still 983.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf98 lsp90 ukn83 mio100 lsp57 div100 bol100 ite100 ukn100 eq188 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...