./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/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 7d436f9bf6df44883ea10fac4397136e5a572f5c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:56:07,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:56:07,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:56:07,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:56:07,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:56:07,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:56:07,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:56:07,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:56:07,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:56:07,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:56:07,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:56:07,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:56:07,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:56:07,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:56:07,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:56:07,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:56:07,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:56:07,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:56:07,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:56:07,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:56:07,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:56:07,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:56:07,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:56:07,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:56:07,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:56:07,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:56:07,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:56:07,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:56:07,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:56:07,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:56:07,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:56:07,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:56:07,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:56:07,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:56:07,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:56:07,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:56:07,346 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:56:07,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:56:07,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:56:07,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:56:07,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:56:07,358 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:56:07,358 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:56:07,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:56:07,359 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:56:07,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:56:07,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:56:07,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:56:07,360 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:56:07,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:56:07,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:56:07,360 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:56:07,361 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:56:07,361 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_b605d42c-3255-4ef9-9a7b-5599c1ee2076/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 -> 7d436f9bf6df44883ea10fac4397136e5a572f5c [2018-11-10 10:56:07,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:56:07,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:56:07,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:56:07,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:56:07,395 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:56:07,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:56:07,434 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/data/20118226e/2c55f216000d43268212ce4d7dc10f55/FLAG2cd2ba728 [2018-11-10 10:56:07,866 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:56:07,866 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/sv-benchmarks/c/termination-memory-alloca/b.06-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:56:07,876 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/data/20118226e/2c55f216000d43268212ce4d7dc10f55/FLAG2cd2ba728 [2018-11-10 10:56:07,887 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/bin-2019/uautomizer/data/20118226e/2c55f216000d43268212ce4d7dc10f55 [2018-11-10 10:56:07,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:56:07,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:56:07,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:56:07,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:56:07,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:56:07,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:56:07" (1/1) ... [2018-11-10 10:56:07,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:07, skipping insertion in model container [2018-11-10 10:56:07,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:56:07" (1/1) ... [2018-11-10 10:56:07,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:56:07,926 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:56:08,091 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:56:08,098 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:56:08,126 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:56:08,152 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:56:08,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08 WrapperNode [2018-11-10 10:56:08,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:56:08,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:56:08,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:56:08,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:56:08,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:56:08,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:56:08,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:56:08,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:56:08,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... [2018-11-10 10:56:08,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:56:08,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:56:08,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:56:08,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:56:08,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b605d42c-3255-4ef9-9a7b-5599c1ee2076/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-10 10:56:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:56:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:56:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:56:08,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:56:08,515 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:56:08,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:08 BoogieIcfgContainer [2018-11-10 10:56:08,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:56:08,516 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:56:08,516 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:56:08,519 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:56:08,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:56:08,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:56:07" (1/3) ... [2018-11-10 10:56:08,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bed856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:56:08, skipping insertion in model container [2018-11-10 10:56:08,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:56:08,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:08" (2/3) ... [2018-11-10 10:56:08,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bed856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:56:08, skipping insertion in model container [2018-11-10 10:56:08,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:56:08,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:08" (3/3) ... [2018-11-10 10:56:08,522 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.06-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:56:08,556 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:56:08,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:56:08,556 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:56:08,557 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:56:08,557 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:56:08,557 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:56:08,557 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:56:08,557 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:56:08,557 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:56:08,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 10:56:08,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 10:56:08,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:56:08,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:56:08,584 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:56:08,584 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:08,584 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:56:08,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 10:56:08,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 10:56:08,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:56:08,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:56:08,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:56:08,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:08,591 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem11, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 10#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 11#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 22#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 15#L555-8true [2018-11-10 10:56:08,592 INFO L795 eck$LassoCheckResult]: Loop: 15#L555-8true assume true; 5#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7#L555-1true test_fun_#t~short7 := test_fun_#t~mem5 > 0; 23#L555-2true assume !test_fun_#t~short7; 28#L555-6true assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 18#L556true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 20#L556-1true SUMMARY for call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 21#L556-2true havoc test_fun_#t~mem8; 3#L557true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 4#L557-1true SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6#L557-2true havoc test_fun_#t~mem9; 14#L558true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L558 16#L558-1true SUMMARY for call write~int(test_fun_#t~mem10 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L558-1 19#L558-2true havoc test_fun_#t~mem10; 15#L555-8true [2018-11-10 10:56:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 10:56:08,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:56:08,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:56:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash -824888113, now seen corresponding path program 1 times [2018-11-10 10:56:08,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:56:08,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:56:08,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:08,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:08,732 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-10 10:56:08,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:56:08,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:56:08,736 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:56:08,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:56:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:56:08,747 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-11-10 10:56:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:56:08,766 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-10 10:56:08,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:56:08,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-10 10:56:08,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 10:56:08,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 21 transitions. [2018-11-10 10:56:08,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 10:56:08,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 10:56:08,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 21 transitions. [2018-11-10 10:56:08,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:56:08,774 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 10:56:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 21 transitions. [2018-11-10 10:56:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 10:56:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 10:56:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 10:56:08,792 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 10:56:08,792 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 10:56:08,792 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:56:08,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 21 transitions. [2018-11-10 10:56:08,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 10:56:08,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:56:08,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:56:08,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:56:08,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:08,794 INFO L793 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 77#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem11, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 78#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 82#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 79#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 66#L555-8 [2018-11-10 10:56:08,794 INFO L795 eck$LassoCheckResult]: Loop: 66#L555-8 assume true; 67#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 74#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 76#L555-2 assume test_fun_#t~short7; 80#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 83#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 84#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 71#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 72#L556-1 SUMMARY for call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 75#L556-2 havoc test_fun_#t~mem8; 68#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 69#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 73#L557-2 havoc test_fun_#t~mem9; 64#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L558 65#L558-1 SUMMARY for call write~int(test_fun_#t~mem10 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L558-1 70#L558-2 havoc test_fun_#t~mem10; 66#L555-8 [2018-11-10 10:56:08,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 10:56:08,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:56:08,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:56:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash -455824116, now seen corresponding path program 1 times [2018-11-10 10:56:08,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:56:08,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:56:08,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:56:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash -125027796, now seen corresponding path program 1 times [2018-11-10 10:56:08,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:56:08,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:56:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:56:09,046 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-10 10:56:09,298 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-10 10:56:09,417 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 10:56:09,429 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:56:09,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:56:09,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:56:09,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:56:09,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:56:09,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:56:09,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:56:09,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:56:09,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.06-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 10:56:09,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:56:09,431 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:56:09,450 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-10 10:56:09,455 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-10 10:56:09,456 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-10 10:56:09,458 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-10 10:56:09,770 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-11-10 10:56:09,871 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-10 10:56:09,872 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-10 10:56:09,874 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-10 10:56:09,877 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-10 10:56:09,879 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-10 10:56:09,881 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-10 10:56:09,882 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-10 10:56:09,883 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-10 10:56:09,884 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-10 10:56:09,886 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-10 10:56:09,887 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-10 10:56:09,888 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-10 10:56:09,889 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-10 10:56:10,334 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:56:10,338 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:56:10,339 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-10 10:56:10,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:56:10,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:56:10,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:56:10,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,344 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-10 10:56:10,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:56:10,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:56:10,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:56:10,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,347 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-10 10:56:10,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:56:10,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:56:10,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:56:10,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,349 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-10 10:56:10,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,357 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-10 10:56:10,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,376 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-10 10:56:10,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,382 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-10 10:56:10,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,392 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-10 10:56:10,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,392 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:56:10,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:56:10,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,401 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-10 10:56:10,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:56:10,411 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-10 10:56:10,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:56:10,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:56:10,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:56:10,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:56:10,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:56:10,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:56:10,423 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:56:10,433 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:56:10,433 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 10:56:10,435 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:56:10,436 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:56:10,437 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:56:10,437 INFO L519 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 10:56:10,507 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 10:56:10,512 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:56:10,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:10,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:56:10,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 10:56:10,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:56:10,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-10 10:56:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:10,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:56:10,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:56:10,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 10:56:10,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-11-10 10:56:10,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-10 10:56:10,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-10 10:56:10,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-10 10:56:10,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 10:56:10,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:56:10,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:56:10,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:41 [2018-11-10 10:56:10,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 10:56:10,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:56:10,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-11-10 10:56:10,833 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-10 10:56:10,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 10:56:10,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand 10 states. [2018-11-10 10:56:10,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand 10 states. Result 43 states and 43 transitions. Complement of second has 16 states. [2018-11-10 10:56:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 10:56:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 10:56:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-11-10 10:56:10,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 16 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-10 10:56:10,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:56:10,946 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:56:10,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:10,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:56:10,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 10:56:10,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:10,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:56:10,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:10,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-10 10:56:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:11,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:56:11,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:11,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:56:11,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 10:56:11,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-11-10 10:56:11,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:11,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-10 10:56:11,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-11-10 10:56:11,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 10:56:11,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:56:11,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-10 10:56:11,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:56:11,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:56:11,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:41 [2018-11-10 10:56:11,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 10:56:11,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:56:11,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:56:11,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-11-10 10:56:11,279 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-10 10:56:11,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 10:56:11,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand 10 states. [2018-11-10 10:56:11,405 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand 10 states. Result 37 states and 38 transitions. Complement of second has 19 states. [2018-11-10 10:56:11,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 10:56:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 10:56:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-11-10 10:56:11,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-10 10:56:11,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:56:11,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 21 letters. Loop has 16 letters. [2018-11-10 10:56:11,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:56:11,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 5 letters. Loop has 32 letters. [2018-11-10 10:56:11,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:56:11,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2018-11-10 10:56:11,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:56:11,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:56:11,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:56:11,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:56:11,409 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:56:11,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:56:11,409 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:56:11,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:56:11,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:56:11 BoogieIcfgContainer [2018-11-10 10:56:11,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:56:11,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:56:11,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:56:11,414 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:56:11,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:08" (3/4) ... [2018-11-10 10:56:11,416 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:56:11,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:56:11,417 INFO L168 Benchmark]: Toolchain (without parser) took 3527.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 952.1 MB in the beginning and 840.3 MB in the end (delta: 111.9 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,417 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:56:11,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -221.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,419 INFO L168 Benchmark]: Boogie Preprocessor took 20.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,419 INFO L168 Benchmark]: RCFGBuilder took 271.45 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: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,419 INFO L168 Benchmark]: BuchiAutomizer took 2896.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 840.3 MB in the end (delta: 286.6 MB). Peak memory consumption was 350.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:11,420 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 840.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:56:11,422 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -221.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.45 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: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2896.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 840.3 MB in the end (delta: 286.6 MB). Peak memory consumption was 350.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 840.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 unknown-#memory_int-unknown[x_ref][x_ref] and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 48 SDslu, 51 SDs, 0 SdLazy, 85 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital442 mio100 ax104 hnf100 lsp93 ukn56 mio100 lsp38 div100 bol100 ite100 ukn100 eq193 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...