./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5b7c2858314131c244395f9ab37913061eb343a6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:29:45,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:29:45,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:29:45,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:29:45,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:29:45,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:29:45,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:29:45,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:29:45,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:29:45,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:29:45,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:29:45,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:29:45,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:29:45,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:29:45,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:29:45,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:29:45,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:29:45,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:29:45,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:29:45,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:29:45,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:29:45,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:29:45,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:29:45,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:29:45,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:29:45,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:29:45,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:29:45,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:29:45,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:29:45,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:29:45,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:29:45,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:29:45,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:29:45,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:29:45,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:29:45,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:29:45,643 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:29:45,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:29:45,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:29:45,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:29:45,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:29:45,653 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:29:45,653 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:29:45,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:29:45,654 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:29:45,655 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:29:45,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:29:45,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:29:45,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:29:45,656 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:29:45,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:29:45,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:29:45,656 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:29:45,659 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:29:45,659 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b7c2858314131c244395f9ab37913061eb343a6 [2018-11-18 12:29:45,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:29:45,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:29:45,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:29:45,695 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:29:45,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:29:45,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:29:45,740 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/data/c72d04cca/4414ff927403495eaeb15a187b66b4d1/FLAG45413401f [2018-11-18 12:29:46,169 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:29:46,169 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:29:46,177 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/data/c72d04cca/4414ff927403495eaeb15a187b66b4d1/FLAG45413401f [2018-11-18 12:29:46,185 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/data/c72d04cca/4414ff927403495eaeb15a187b66b4d1 [2018-11-18 12:29:46,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:29:46,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:29:46,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:29:46,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:29:46,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:29:46,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46, skipping insertion in model container [2018-11-18 12:29:46,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:29:46,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:29:46,414 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:29:46,420 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:29:46,449 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:29:46,524 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:29:46,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46 WrapperNode [2018-11-18 12:29:46,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:29:46,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:29:46,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:29:46,525 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:29:46,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:29:46,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:29:46,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:29:46,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:29:46,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... [2018-11-18 12:29:46,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:29:46,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:29:46,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:29:46,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:29:46,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0105b5b-3088-437a-ba5b-c4cb9848600c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:29:46,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:29:46,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:29:46,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:29:46,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:29:46,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:29:46,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:29:46,786 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:29:46,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:46 BoogieIcfgContainer [2018-11-18 12:29:46,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:29:46,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:29:46,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:29:46,789 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:29:46,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:29:46,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:29:46" (1/3) ... [2018-11-18 12:29:46,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79975fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:29:46, skipping insertion in model container [2018-11-18 12:29:46,791 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:29:46,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:46" (2/3) ... [2018-11-18 12:29:46,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79975fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:29:46, skipping insertion in model container [2018-11-18 12:29:46,791 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:29:46,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:46" (3/3) ... [2018-11-18 12:29:46,793 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:29:46,835 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:29:46,836 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:29:46,836 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:29:46,836 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:29:46,836 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:29:46,836 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:29:46,836 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:29:46,836 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:29:46,836 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:29:46,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 12:29:46,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:29:46,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:29:46,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:29:46,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:29:46,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:29:46,867 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:29:46,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 12:29:46,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:29:46,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:29:46,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:29:46,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:29:46,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:29:46,874 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L557-6true [2018-11-18 12:29:46,874 INFO L796 eck$LassoCheckResult]: Loop: 7#L557-6true assume true; 8#L557-1true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L557-2true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 5#L557-4true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem12; 7#L557-6true [2018-11-18 12:29:46,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:46,878 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:29:46,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:46,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:46,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:46,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1110315, now seen corresponding path program 1 times [2018-11-18 12:29:46,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:46,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:46,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:46,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:47,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash 889537517, now seen corresponding path program 1 times [2018-11-18 12:29:47,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:47,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:47,255 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-18 12:29:47,795 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2018-11-18 12:29:48,010 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 12:29:48,020 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:29:48,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:29:48,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:29:48,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:29:48,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:29:48,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:29:48,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:29:48,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:29:48,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.07-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 12:29:48,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:29:48,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:29:48,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,484 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2018-11-18 12:29:48,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:29:48,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:29:48,928 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:29:48,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:29:48,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:29:48,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:29:48,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:48,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:29:48,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:29:48,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:29:48,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:29:48,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:29:48,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:29:48,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:29:48,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:29:49,012 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:29:49,028 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:29:49,028 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:29:49,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:29:49,031 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:29:49,031 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:29:49,032 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-18 12:29:49,138 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:29:49,144 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:29:49,145 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:29:49,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:49,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:29:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:49,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:29:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:29:49,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:29:49,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2018-11-18 12:29:49,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 40 states and 45 transitions. Complement of second has 9 states. [2018-11-18 12:29:49,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:29:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:29:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-18 12:29:49,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-18 12:29:49,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:29:49,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 12:29:49,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:29:49,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 12:29:49,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:29:49,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2018-11-18 12:29:49,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:29:49,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 14 states and 17 transitions. [2018-11-18 12:29:49,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 12:29:49,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 12:29:49,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 12:29:49,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:29:49,334 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 12:29:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 12:29:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-18 12:29:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 12:29:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-18 12:29:49,352 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 12:29:49,353 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 12:29:49,353 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:29:49,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-18 12:29:49,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:29:49,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:29:49,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:29:49,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:29:49,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:29:49,354 INFO L794 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 265#L557-6 assume true; 271#L557-1 [2018-11-18 12:29:49,354 INFO L796 eck$LassoCheckResult]: Loop: 271#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 273#L557-2 assume !test_fun_#t~short10; 266#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem12; 267#L557-6 assume true; 271#L557-1 [2018-11-18 12:29:49,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:29:49,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:49,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:49,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:49,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:49,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:29:49,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1174937, now seen corresponding path program 1 times [2018-11-18 12:29:49,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:29:49,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:29:49,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:29:49,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:29:49,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:29:49,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:29:49,424 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 12:29:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:29:49,439 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-18 12:29:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:29:49,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-18 12:29:49,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:29:49,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-18 12:29:49,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:29:49,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:29:49,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:29:49,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:29:49,442 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:29:49,442 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:29:49,442 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:29:49,442 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:29:49,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:29:49,442 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:29:49,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:29:49,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:29:49 BoogieIcfgContainer [2018-11-18 12:29:49,448 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:29:49,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:29:49,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:29:49,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:29:49,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:46" (3/4) ... [2018-11-18 12:29:49,452 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:29:49,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:29:49,453 INFO L168 Benchmark]: Toolchain (without parser) took 3265.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 882.7 MB in the end (delta: 73.8 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,454 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:29:49,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,455 INFO L168 Benchmark]: Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,456 INFO L168 Benchmark]: RCFGBuilder took 217.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,456 INFO L168 Benchmark]: BuchiAutomizer took 2660.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.7 MB in the end (delta: 225.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:29:49,457 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 882.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:29:49,460 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2660.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.7 MB in the end (delta: 225.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 882.7 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 17 SDslu, 13 SDs, 0 SdLazy, 23 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital438 mio100 ax104 hnf100 lsp93 ukn52 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...