./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-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_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/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 e1996219c6dbc0f4aa6a0486eb748fdb92fa73f6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:33:58,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:33:58,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:33:58,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:33:58,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:33:58,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:33:58,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:33:58,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:33:58,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:33:58,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:33:58,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:33:58,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:33:58,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:33:58,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:33:58,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:33:58,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:33:58,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:33:58,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:33:58,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:33:58,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:33:58,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:33:58,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:33:58,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:33:58,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:33:58,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:33:58,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:33:58,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:33:58,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:33:58,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:33:58,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:33:58,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:33:58,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:33:58,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:33:58,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:33:58,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:33:58,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:33:58,288 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:33:58,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:33:58,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:33:58,302 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:33:58,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:33:58,302 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:33:58,302 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:33:58,302 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:33:58,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:33:58,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:33:58,304 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:33:58,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:33:58,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:33:58,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:33:58,307 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:33:58,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:33:58,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:33:58,307 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:33:58,308 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:33:58,308 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_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/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 -> e1996219c6dbc0f4aa6a0486eb748fdb92fa73f6 [2018-11-18 09:33:58,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:33:58,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:33:58,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:33:58,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:33:58,349 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:33:58,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:33:58,406 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/data/4f5c63683/e1da56b75f354286993646d48f3bed14/FLAG03e950c2d [2018-11-18 09:33:58,811 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:33:58,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:33:58,821 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/data/4f5c63683/e1da56b75f354286993646d48f3bed14/FLAG03e950c2d [2018-11-18 09:33:59,200 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/bin-2019/uautomizer/data/4f5c63683/e1da56b75f354286993646d48f3bed14 [2018-11-18 09:33:59,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:33:59,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:33:59,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:33:59,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:33:59,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:33:59,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5587dbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59, skipping insertion in model container [2018-11-18 09:33:59,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:33:59,265 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:33:59,503 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:33:59,511 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:33:59,545 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:33:59,632 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:33:59,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59 WrapperNode [2018-11-18 09:33:59,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:33:59,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:33:59,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:33:59,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:33:59,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:33:59,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:33:59,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:33:59,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:33:59,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... [2018-11-18 09:33:59,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:33:59,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:33:59,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:33:59,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:33:59,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1300d3d3-4e3f-4c1b-9261-e68091eaaca5/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 09:33:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:33:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:33:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:33:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:33:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:33:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:33:59,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:33:59,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:59 BoogieIcfgContainer [2018-11-18 09:33:59,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:33:59,916 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:33:59,916 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:33:59,919 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:33:59,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:59,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:33:59" (1/3) ... [2018-11-18 09:33:59,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c5a56fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:33:59, skipping insertion in model container [2018-11-18 09:33:59,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:59,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:59" (2/3) ... [2018-11-18 09:33:59,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c5a56fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:33:59, skipping insertion in model container [2018-11-18 09:33:59,921 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:59,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:59" (3/3) ... [2018-11-18 09:33:59,922 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:33:59,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:33:59,965 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:33:59,965 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:33:59,965 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:33:59,965 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:33:59,965 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:33:59,965 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:33:59,965 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:33:59,966 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:33:59,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 09:33:59,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:33:59,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:59,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:59,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 09:33:59,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:33:59,997 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:33:59,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 09:33:59,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:33:59,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:59,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:59,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 09:33:59,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:34:00,006 INFO L794 eck$LassoCheckResult]: Stem: 5#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~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 9#L556-6true [2018-11-18 09:34:00,006 INFO L796 eck$LassoCheckResult]: Loop: 9#L556-6true assume true; 10#L556-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; 13#L556-2true assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 6#L556-4true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 + test_fun_#t~mem12, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 9#L556-6true [2018-11-18 09:34:00,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-18 09:34:00,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:34:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:34:00,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1264235, now seen corresponding path program 1 times [2018-11-18 09:34:00,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:34:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:34:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1806873998, now seen corresponding path program 1 times [2018-11-18 09:34:00,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:34:00,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:34:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:00,373 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-18 09:34:00,750 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2018-11-18 09:34:00,860 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-18 09:34:00,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:34:00,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:34:00,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:34:00,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:34:00,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:34:00,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:34:00,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:34:00,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:34:00,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 09:34:00,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:34:00,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:34:00,890 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 09:34:00,905 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 09:34:00,909 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 09:34:00,920 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 09:34:00,923 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 09:34:00,925 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 09:34:00,927 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 09:34:00,929 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 09:34:01,166 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-18 09:34:01,167 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 09:34:01,168 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 09:34:01,170 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 09:34:01,176 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 09:34:01,177 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 09:34:01,184 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 09:34:01,187 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 09:34:01,188 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 09:34:01,190 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 09:34:01,192 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 09:34:01,194 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 09:34:01,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:34:01,514 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:34:01,516 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 09:34:01,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:34:01,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:34:01,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:34:01,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,529 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 09:34:01,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,532 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 09:34:01,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,535 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 09:34:01,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:34:01,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:34:01,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:34:01,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:34:01,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:34:01,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:34:01,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:34:01,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:34:01,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:34:01,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:34:01,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:34:01,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:34:01,599 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:34:01,599 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 09:34:01,601 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:34:01,603 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 09:34:01,603 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:34:01,603 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483647 Supporting invariants [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 >= 0] [2018-11-18 09:34:01,650 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-18 09:34:01,655 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:34:01,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:01,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:34:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:01,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:34:01,824 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 09:34:01,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 09:34:01,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 6 states. [2018-11-18 09:34:01,940 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 6 states. Result 45 states and 50 transitions. Complement of second has 10 states. [2018-11-18 09:34:01,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:34:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:34:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-18 09:34:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 09:34:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:34:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 09:34:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:34:01,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 09:34:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:34:01,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 50 transitions. [2018-11-18 09:34:01,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:34:01,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 15 states and 18 transitions. [2018-11-18 09:34:01,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 09:34:01,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:34:01,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2018-11-18 09:34:01,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:34:01,952 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-18 09:34:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2018-11-18 09:34:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-18 09:34:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 09:34:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 09:34:01,971 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 09:34:01,972 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 09:34:01,972 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:34:01,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 09:34:01,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:34:01,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:34:01,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:34:01,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:34:01,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:34:01,973 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#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~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 166#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 167#L556-6 assume true; 173#L556-1 [2018-11-18 09:34:01,973 INFO L796 eck$LassoCheckResult]: Loop: 173#L556-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; 176#L556-2 assume !test_fun_#t~short10; 169#L556-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 + test_fun_#t~mem12, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 170#L556-6 assume true; 173#L556-1 [2018-11-18 09:34:01,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2018-11-18 09:34:01,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:34:01,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:34:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:01,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:34:01,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1328857, now seen corresponding path program 1 times [2018-11-18 09:34:01,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:34:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:34:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:01,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:02,037 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 09:34:02,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:02,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:34:02,041 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:34:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:34:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:34:02,044 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 09:34:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:02,064 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-18 09:34:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:34:02,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-18 09:34:02,066 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:34:02,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-18 09:34:02,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:34:02,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:34:02,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:34:02,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:34:02,066 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:34:02,066 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:34:02,067 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:34:02,067 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:34:02,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:34:02,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:34:02,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:34:02,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:34:02 BoogieIcfgContainer [2018-11-18 09:34:02,071 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:34:02,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:34:02,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:34:02,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:34:02,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:59" (3/4) ... [2018-11-18 09:34:02,076 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:34:02,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:34:02,077 INFO L168 Benchmark]: Toolchain (without parser) took 2874.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 958.1 MB in the beginning and 813.3 MB in the end (delta: 144.8 MB). Peak memory consumption was 254.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,078 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:34:02,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.06 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,079 INFO L168 Benchmark]: Boogie Preprocessor took 18.92 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,080 INFO L168 Benchmark]: RCFGBuilder took 229.64 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,080 INFO L168 Benchmark]: BuchiAutomizer took 2155.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 813.3 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:02,081 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.1 GB. Free memory is still 813.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:34:02,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.06 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.92 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.64 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2155.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 813.3 MB in the end (delta: 259.1 MB). Peak memory consumption was 259.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.1 GB. Free memory is still 813.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 15 SDslu, 18 SDs, 0 SdLazy, 26 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax109 hnf100 lsp88 ukn69 mio100 lsp36 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 65ms VariablesStem: 8 VariablesLoop: 4 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...