./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/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 32bit --witnessprinter.graph.data.programhash 95dd23c3faf110dda910911db52d9ffd09e9e4b3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:31:09,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:31:09,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:31:09,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:31:09,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:31:09,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:31:09,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:31:09,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:31:09,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:31:09,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:31:09,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:31:09,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:31:09,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:31:09,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:31:09,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:31:09,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:31:09,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:31:09,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:31:09,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:31:09,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:31:09,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:31:09,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:31:09,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:31:09,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:31:09,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:31:09,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:31:09,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:31:09,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:31:09,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:31:09,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:31:09,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:31:09,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:31:09,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:31:09,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:31:09,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:31:09,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:31:09,409 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 21:31:09,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:31:09,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:31:09,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:31:09,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:31:09,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:31:09,420 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:31:09,420 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:31:09,420 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:31:09,420 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:31:09,420 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:31:09,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:31:09,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:31:09,422 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:31:09,423 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:31:09,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:31:09,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:31:09,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:31:09,423 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:31:09,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:31:09,424 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:31:09,424 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:31:09,424 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:31:09,425 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-11-22 21:31:09,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:31:09,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:31:09,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:31:09,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:31:09,461 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:31:09,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-11-22 21:31:09,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/data/71bb23172/e7767c82f9e0437c8ef9e2678c72710a/FLAGd42fadfe4 [2018-11-22 21:31:09,874 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:31:09,875 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-11-22 21:31:09,885 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/data/71bb23172/e7767c82f9e0437c8ef9e2678c72710a/FLAGd42fadfe4 [2018-11-22 21:31:10,269 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/bin-2019/uautomizer/data/71bb23172/e7767c82f9e0437c8ef9e2678c72710a [2018-11-22 21:31:10,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:31:10,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:31:10,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:31:10,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:31:10,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:31:10,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd6f908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10, skipping insertion in model container [2018-11-22 21:31:10,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:31:10,314 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:31:10,535 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:31:10,588 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:31:10,630 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:31:10,677 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:31:10,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10 WrapperNode [2018-11-22 21:31:10,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:31:10,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:31:10,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:31:10,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:31:10,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:31:10,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:31:10,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:31:10,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:31:10,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... [2018-11-22 21:31:10,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:31:10,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:31:10,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:31:10,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:31:10,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_377e381f-7a04-4346-b1f4-8eaa7da935d3/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-22 21:31:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:31:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 21:31:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-22 21:31:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:31:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:31:10,956 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:31:10,956 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-22 21:31:10,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:10 BoogieIcfgContainer [2018-11-22 21:31:10,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:31:10,957 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:31:10,958 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:31:10,961 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:31:10,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:31:10,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:31:10" (1/3) ... [2018-11-22 21:31:10,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@435c829c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:31:10, skipping insertion in model container [2018-11-22 21:31:10,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:31:10,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:10" (2/3) ... [2018-11-22 21:31:10,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@435c829c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:31:10, skipping insertion in model container [2018-11-22 21:31:10,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:31:10,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:10" (3/3) ... [2018-11-22 21:31:10,965 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-11-22 21:31:11,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:31:11,003 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:31:11,003 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:31:11,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:31:11,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:31:11,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:31:11,003 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:31:11,003 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:31:11,003 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:31:11,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 21:31:11,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:31:11,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:31:11,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:31:11,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:31:11,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:31:11,033 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:31:11,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 21:31:11,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:31:11,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:31:11,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:31:11,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:31:11,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:31:11,038 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 3#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 9#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 4#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0; 5#L1443true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 10#L1444-3true [2018-11-22 21:31:11,038 INFO L796 eck$LassoCheckResult]: Loop: 10#L1444-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 13#L1073-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 6#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset;call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 8#L1444-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 10#L1444-3true [2018-11-22 21:31:11,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-22 21:31:11,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:31:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:31:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:11,157 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-22 21:31:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:31:11,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:31:11,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-22 21:31:11,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:31:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:31:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:11,386 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-11-22 21:31:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:11,424 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-22 21:31:11,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:31:11,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2018-11-22 21:31:11,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:31:11,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 12 states and 13 transitions. [2018-11-22 21:31:11,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-22 21:31:11,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-22 21:31:11,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-22 21:31:11,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:31:11,433 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-22 21:31:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-22 21:31:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-11-22 21:31:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-22 21:31:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-22 21:31:11,453 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-22 21:31:11,453 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-22 21:31:11,453 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:31:11,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-22 21:31:11,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:31:11,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:31:11,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:31:11,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:31:11,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:31:11,455 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 45#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 46#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 47#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0; 48#L1443 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 51#L1444-3 [2018-11-22 21:31:11,455 INFO L796 eck$LassoCheckResult]: Loop: 51#L1444-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 53#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 49#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset;call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 50#L1444-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 51#L1444-3 [2018-11-22 21:31:11,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2018-11-22 21:31:11,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:31:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:31:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 2 times [2018-11-22 21:31:11,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:31:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:31:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -592037012, now seen corresponding path program 1 times [2018-11-22 21:31:11,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:31:11,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:31:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:31:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:31:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:31:11,756 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-22 21:31:11,806 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:31:11,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:31:11,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:31:11,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:31:11,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:31:11,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:31:11,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:31:11,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:31:11,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_3_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-22 21:31:11,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:31:11,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:31:11,828 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-22 21:31:11,833 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-22 21:31:11,835 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-22 21:31:11,836 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-22 21:31:11,838 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-22 21:31:11,841 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-22 21:31:11,843 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-22 21:31:11,845 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-22 21:31:11,847 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-22 21:31:11,854 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-22 21:31:12,017 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-22 21:31:12,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:31:12,071 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-22 21:31:12,073 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-22 21:31:12,074 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-22 21:31:12,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:31:12,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:31:12,358 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-22 21:31:12,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,371 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-22 21:31:12,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,374 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-22 21:31:12,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,377 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-22 21:31:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,379 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-22 21:31:12,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,386 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-22 21:31:12,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,389 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-22 21:31:12,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,391 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-22 21:31:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,396 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-22 21:31:12,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,402 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-22 21:31:12,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,405 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-22 21:31:12,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,413 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-22 21:31:12,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:31:12,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,416 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:31:12,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,428 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-22 21:31:12,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,435 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-22 21:31:12,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,435 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:31:12,436 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:31:12,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,454 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-22 21:31:12,454 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 21:31:12,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,483 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-22 21:31:12,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,490 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-22 21:31:12,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:31:12,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:31:12,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:31:12,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:31:12,493 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-22 21:31:12,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:31:12,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:31:12,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:31:12,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:31:12,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:31:12,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:31:12,530 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:31:12,562 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 21:31:12,562 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 21:31:12,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:31:12,565 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:31:12,565 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:31:12,565 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2018-11-22 21:31:12,578 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-22 21:31:12,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:12,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:12,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:12,640 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-22 21:31:12,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 21:31:12,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-22 21:31:12,676 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 4 states. [2018-11-22 21:31:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:31:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:31:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-22 21:31:12,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 21:31:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:31:12,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-22 21:31:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:31:12,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 21:31:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:31:12,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-22 21:31:12,681 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:31:12,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-22 21:31:12,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:31:12,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:31:12,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:31:12,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:31:12,682 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:31:12,682 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:31:12,682 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:31:12,682 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:31:12,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:31:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:31:12,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:31:12,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:31:12 BoogieIcfgContainer [2018-11-22 21:31:12,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:31:12,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:31:12,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:31:12,687 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:31:12,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:10" (3/4) ... [2018-11-22 21:31:12,690 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:31:12,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:31:12,690 INFO L168 Benchmark]: Toolchain (without parser) took 2419.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -235.9 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:12,691 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:12,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -198.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:12,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:12,692 INFO L168 Benchmark]: Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:12,692 INFO L168 Benchmark]: RCFGBuilder took 227.70 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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:12,693 INFO L168 Benchmark]: BuchiAutomizer took 1729.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:12,693 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:12,696 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -198.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.70 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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1729.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 len + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 19 SDslu, 21 SDs, 0 SdLazy, 20 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital245 mio100 ax112 hnf101 lsp85 ukn63 mio100 lsp60 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...