./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.08-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_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/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 b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:33:58,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:33:58,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:33:58,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:33:58,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:33:58,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:33:58,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:33:58,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:33:58,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:33:58,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:33:58,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:33:58,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:33:58,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:33:58,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:33:58,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:33:58,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:33:58,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:33:58,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:33:58,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:33:58,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:33:58,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:33:58,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:33:58,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:33:58,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:33:58,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:33:58,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:33:58,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:33:58,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:33:58,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:33:58,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:33:58,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:33:58,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:33:58,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:33:58,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:33:58,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:33:58,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:33:58,057 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:33:58,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:33:58,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:33:58,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:33:58,068 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:33:58,068 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:33:58,068 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:33:58,068 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:33:58,068 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:33:58,068 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:33:58,069 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:33:58,069 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:33:58,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:33:58,069 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:33:58,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:33:58,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:33:58,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:33:58,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:33:58,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:33:58,071 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:33:58,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:33:58,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:33:58,071 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:33:58,072 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:33:58,072 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_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/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 -> b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a [2018-11-10 07:33:58,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:33:58,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:33:58,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:33:58,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:33:58,106 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:33:58,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-10 07:33:58,143 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/data/24c451727/cccc582ac6d34bd38235089d2021526a/FLAGac673c6da [2018-11-10 07:33:58,481 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:33:58,482 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/sv-benchmarks/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-10 07:33:58,489 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/data/24c451727/cccc582ac6d34bd38235089d2021526a/FLAGac673c6da [2018-11-10 07:33:58,501 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/bin-2019/uautomizer/data/24c451727/cccc582ac6d34bd38235089d2021526a [2018-11-10 07:33:58,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:33:58,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:33:58,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:33:58,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:33:58,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:33:58,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58, skipping insertion in model container [2018-11-10 07:33:58,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:33:58,542 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:33:58,723 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:33:58,730 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:33:58,758 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:33:58,782 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:33:58,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58 WrapperNode [2018-11-10 07:33:58,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:33:58,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:33:58,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:33:58,783 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:33:58,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:33:58,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:33:58,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:33:58,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:33:58,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... [2018-11-10 07:33:58,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:33:58,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:33:58,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:33:58,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:33:58,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48416078-fc63-4dba-bd7d-f1f3d9b2ef8a/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 07:33:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:33:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:33:58,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:33:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:33:59,144 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:33:59,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:59 BoogieIcfgContainer [2018-11-10 07:33:59,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:33:59,145 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:33:59,145 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:33:59,149 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:33:59,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:59,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:33:58" (1/3) ... [2018-11-10 07:33:59,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bb0984f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:33:59, skipping insertion in model container [2018-11-10 07:33:59,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:59,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:33:58" (2/3) ... [2018-11-10 07:33:59,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bb0984f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:33:59, skipping insertion in model container [2018-11-10 07:33:59,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:33:59,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:59" (3/3) ... [2018-11-10 07:33:59,153 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-10 07:33:59,197 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:33:59,197 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:33:59,197 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:33:59,198 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:33:59,198 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:33:59,198 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:33:59,198 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:33:59,198 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:33:59,198 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:33:59,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 07:33:59,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:59,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:59,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:59,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:33:59,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:59,233 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:33:59,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 07:33:59,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:59,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:59,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:59,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:33:59,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:59,242 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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 21#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 16#L555-9true [2018-11-10 07:33:59,243 INFO L795 eck$LassoCheckResult]: Loop: 16#L555-9true assume true; 6#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 8#L555-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 22#L555-2true test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 24#L555-3true assume !test_fun_#t~short8; 15#L555-7true assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 17#L556true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 19#L556-1true SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 20#L556-2true havoc test_fun_#t~mem9; 4#L557true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 5#L557-1true SUMMARY for call write~int(test_fun_#t~mem10 + 2, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7#L557-2true havoc test_fun_#t~mem10; 16#L555-9true [2018-11-10 07:33:59,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 07:33:59,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1092946381, now seen corresponding path program 1 times [2018-11-10 07:33:59,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:59,410 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 07:33:59,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:59,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:33:59,414 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:33:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:33:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:33:59,425 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-10 07:33:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:59,451 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-10 07:33:59,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:33:59,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2018-11-10 07:33:59,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:59,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 19 transitions. [2018-11-10 07:33:59,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 07:33:59,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 07:33:59,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 19 transitions. [2018-11-10 07:33:59,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:33:59,458 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 07:33:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 19 transitions. [2018-11-10 07:33:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 07:33:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 07:33:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-10 07:33:59,482 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 07:33:59,482 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 07:33:59,482 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:33:59,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 19 transitions. [2018-11-10 07:33:59,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 07:33:59,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:33:59,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:33:59,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:33:59,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:59,484 INFO L793 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 71#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~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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; 72#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 76#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 73#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 64#L555-9 [2018-11-10 07:33:59,484 INFO L795 eck$LassoCheckResult]: Loop: 64#L555-9 assume true; 65#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 68#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 70#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 74#L555-3 assume test_fun_#t~short8; 77#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-4 78#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647; 60#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 61#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 66#L556-1 SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 69#L556-2 havoc test_fun_#t~mem9; 62#L557 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 63#L557-1 SUMMARY for call write~int(test_fun_#t~mem10 + 2, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 67#L557-2 havoc test_fun_#t~mem10; 64#L555-9 [2018-11-10 07:33:59,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 07:33:59,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:59,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:59,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1883129872, now seen corresponding path program 1 times [2018-11-10 07:33:59,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:33:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1061774032, now seen corresponding path program 1 times [2018-11-10 07:33:59,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:33:59,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:33:59,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:59,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:33:59,727 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-11-10 07:34:00,047 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 07:34:00,150 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 07:34:00,163 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:34:00,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:34:00,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:34:00,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:34:00,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:34:00,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:34:00,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:34:00,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:34:00,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.08-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 07:34:00,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:34:00,165 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:34:00,180 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 07:34:00,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-10 07:34:00,185 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 07:34:00,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-10 07:34:00,189 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 07:34:00,191 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 07:34:00,193 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 07:34:00,197 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 07:34:00,199 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 07:34:00,505 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 07:34:00,592 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 07:34:00,593 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 07:34:00,598 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 07:34:00,600 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 07:34:00,601 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 07:34:00,602 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 07:34:00,604 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 07:34:01,042 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:34:01,045 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:34:01,047 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 07:34:01,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:34:01,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:34:01,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:34:01,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,052 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 07:34:01,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:34:01,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:34:01,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:34:01,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,055 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 07:34:01,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,061 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 07:34:01,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:34:01,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:34:01,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:34:01,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,064 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 07:34:01,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:34:01,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:34:01,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:34:01,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,067 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 07:34:01,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,073 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 07:34:01,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:34:01,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:34:01,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:34:01,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,075 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 07:34:01,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,080 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 07:34:01,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,084 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 07:34:01,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,098 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 07:34:01,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:34:01,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:34:01,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,108 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 07:34:01,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,112 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 07:34:01,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,113 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:34:01,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:34:01,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:34:01,121 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 07:34:01,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:34:01,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:34:01,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:34:01,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:34:01,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:34:01,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:34:01,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:34:01,153 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:34:01,153 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:34:01,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:34:01,156 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:34:01,157 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:34:01,157 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) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-10 07:34:01,220 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 07:34:01,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:34:01,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:01,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:01,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:01,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,428 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-11-10 07:34:01,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-11-10 07:34:01,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:01,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,474 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 45 treesize of output 42 [2018-11-10 07:34:01,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:01,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 07:34:01,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-10 07:34:01,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:117 [2018-11-10 07:34:01,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-10 07:34:01,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:01,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-11-10 07:34:01,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:34:01,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-10 07:34:01,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:34:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:34:01,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:01,720 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:20 [2018-11-10 07:34:01,744 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 07:34:01,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 07:34:01,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1 Second operand 13 states. [2018-11-10 07:34:01,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1. Second operand 13 states. Result 43 states and 43 transitions. Complement of second has 21 states. [2018-11-10 07:34:01,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 07:34:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 07:34:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-10 07:34:01,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-10 07:34:01,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:34:01,932 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:34:01,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:01,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:01,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:02,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,127 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-11-10 07:34:02,132 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 53 treesize of output 42 [2018-11-10 07:34:02,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:02,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 63 [2018-11-10 07:34:02,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:02,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 07:34:02,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-10 07:34:02,236 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:117 [2018-11-10 07:34:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-10 07:34:02,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:34:02,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-11-10 07:34:02,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:34:02,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-10 07:34:02,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:34:02,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:34:02,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:02,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:20 [2018-11-10 07:34:02,416 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 07:34:02,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 07:34:02,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1 Second operand 13 states. [2018-11-10 07:34:02,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1. Second operand 13 states. Result 33 states and 34 transitions. Complement of second has 24 states. [2018-11-10 07:34:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-10 07:34:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 07:34:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-10 07:34:02,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-10 07:34:02,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:34:02,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. Stem has 19 letters. Loop has 14 letters. [2018-11-10 07:34:02,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:34:02,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. Stem has 5 letters. Loop has 28 letters. [2018-11-10 07:34:02,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:34:02,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 34 transitions. [2018-11-10 07:34:02,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:34:02,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2018-11-10 07:34:02,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:34:02,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:34:02,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:34:02,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:34:02,624 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:34:02,624 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:34:02,624 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:34:02,624 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:34:02,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:34:02,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:34:02,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:34:02,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:34:02 BoogieIcfgContainer [2018-11-10 07:34:02,629 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:34:02,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:34:02,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:34:02,629 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:34:02,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:33:59" (3/4) ... [2018-11-10 07:34:02,632 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:34:02,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:34:02,632 INFO L168 Benchmark]: Toolchain (without parser) took 4128.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 956.6 MB in the beginning and 839.8 MB in the end (delta: 116.8 MB). Peak memory consumption was 328.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:02,633 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:34:02,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.36 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:02,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:02,634 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:34:02,634 INFO L168 Benchmark]: RCFGBuilder took 271.33 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.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:02,635 INFO L168 Benchmark]: BuchiAutomizer took 3483.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 839.8 MB in the end (delta: 270.3 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:02,635 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.2 GB. Free memory is still 839.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:34:02,637 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.36 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 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.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 271.33 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.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3483.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 839.8 MB in the end (delta: 270.3 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.2 GB. Free memory is still 839.8 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[x_ref][x_ref] + 4294967293 and consists of 13 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 1.3s. 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 19 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40 SDtfs, 41 SDslu, 38 SDs, 0 SdLazy, 113 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax106 hnf100 lsp92 ukn72 mio100 lsp37 div100 bol100 ite100 ukn100 eq195 hnf87 smp95 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...