./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/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 855ef959a267a6e57a6a3e6d7925f66e84a760d6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:18,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:18,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:18,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:18,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:18,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:18,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:18,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:18,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:18,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:18,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:18,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:18,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:18,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:18,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:18,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:18,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:18,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:18,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:18,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:18,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:18,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:18,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:18,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:18,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:18,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:18,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:18,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:18,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:18,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:18,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:18,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:18,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:18,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:18,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:18,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:18,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:18,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:18,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:18,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:18,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:18,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:18,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:18,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:18,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:18,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:18,518 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:18,518 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:18,518 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:18,518 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:18,518 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:18,519 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:18,519 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:18,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:18,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:18,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:18,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:18,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:18,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:18,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:18,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:18,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:18,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:18,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:18,524 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:18,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:18,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:18,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:18,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:18,525 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:18,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:18,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:18,526 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:18,527 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:18,527 INFO L138 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_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/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 -> 855ef959a267a6e57a6a3e6d7925f66e84a760d6 [2019-10-22 08:54:18,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:18,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:18,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:18,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:18,566 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:18,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-10-22 08:54:18,621 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/data/e1ed3345c/159373d1bfee402085c3921b8c0ae53a/FLAGe8ac73ee0 [2019-10-22 08:54:19,112 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:19,116 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-10-22 08:54:19,128 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/data/e1ed3345c/159373d1bfee402085c3921b8c0ae53a/FLAGe8ac73ee0 [2019-10-22 08:54:19,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/uautomizer/data/e1ed3345c/159373d1bfee402085c3921b8c0ae53a [2019-10-22 08:54:19,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:19,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:19,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:19,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:19,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:19,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:19" (1/1) ... [2019-10-22 08:54:19,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ea8c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:19, skipping insertion in model container [2019-10-22 08:54:19,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:19" (1/1) ... [2019-10-22 08:54:19,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:19,643 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:20,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:20,085 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:20,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:20,219 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:20,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20 WrapperNode [2019-10-22 08:54:20,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:20,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:20,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:20,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:20,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:20,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:20,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:20,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:20,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... [2019-10-22 08:54:20,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:20,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:20,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:20,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:20,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8c3e20b-0f2e-442c-a5f3-f0a7b57d327c/bin/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 [2019-10-22 08:54:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:54:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:54:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:20,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:20,582 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-22 08:54:20,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:20 BoogieIcfgContainer [2019-10-22 08:54:20,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:20,584 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:20,584 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:20,587 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:20,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:20,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:19" (1/3) ... [2019-10-22 08:54:20,590 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7cb8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:20, skipping insertion in model container [2019-10-22 08:54:20,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:20,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:20" (2/3) ... [2019-10-22 08:54:20,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7cb8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:20, skipping insertion in model container [2019-10-22 08:54:20,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:20,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:20" (3/3) ... [2019-10-22 08:54:20,593 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_3.i [2019-10-22 08:54:20,647 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:20,647 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:20,647 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:20,647 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:20,647 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:20,647 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:20,647 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:20,648 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:20,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:54:20,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:20,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:20,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:20,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:20,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:20,689 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:20,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:54:20,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:20,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:20,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:20,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:20,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:20,694 INFO L791 eck$LassoCheckResult]: Stem: 6#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.allocOnStack(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; 13#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 8#L530true 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; 4#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 9#L767-3true [2019-10-22 08:54:20,694 INFO L793 eck$LassoCheckResult]: Loop: 9#L767-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; 5#L527-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 11#L530-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); 7#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 9#L767-3true [2019-10-22 08:54:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:54:20,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469929788] [2019-10-22 08:54:20,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:20,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469929788] [2019-10-22 08:54:20,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:20,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:20,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054733959] [2019-10-22 08:54:20,847 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-10-22 08:54:20,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546087264] [2019-10-22 08:54:20,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:21,088 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-10-22 08:54:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:21,137 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-10-22 08:54:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:21,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-10-22 08:54:21,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:21,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 12 states and 13 transitions. [2019-10-22 08:54:21,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:54:21,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:54:21,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-10-22 08:54:21,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:21,147 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 08:54:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-10-22 08:54:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-10-22 08:54:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:54:21,176 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:54:21,176 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:54:21,176 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:21,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 08:54:21,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:21,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:21,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:21,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:21,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:21,178 INFO L791 eck$LassoCheckResult]: Stem: 51#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.allocOnStack(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#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 53#L530 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; 49#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 50#L767-3 [2019-10-22 08:54:21,178 INFO L793 eck$LassoCheckResult]: Loop: 50#L767-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; 47#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 48#L530-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); 52#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 50#L767-3 [2019-10-22 08:54:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-10-22 08:54:21,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733039542] [2019-10-22 08:54:21,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 2 times [2019-10-22 08:54:21,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624915511] [2019-10-22 08:54:21,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash -592037012, now seen corresponding path program 1 times [2019-10-22 08:54:21,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873495217] [2019-10-22 08:54:21,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,656 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-22 08:54:21,751 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:21,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:21,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:21,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:21,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:21,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:21,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:21,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:21,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_3.i_Iteration2_Lasso [2019-10-22 08:54:21,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:21,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,019 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 08:54:22,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,737 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-22 08:54:22,806 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:22,812 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:22,815 INFO L120 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 [2019-10-22 08:54:22,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,832 INFO L120 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 [2019-10-22 08:54:22,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,837 INFO L120 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 [2019-10-22 08:54:22,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,842 INFO L120 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 [2019-10-22 08:54:22,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,848 INFO L120 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 [2019-10-22 08:54:22,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,852 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,866 INFO L120 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 [2019-10-22 08:54:22,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,870 INFO L120 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 [2019-10-22 08:54:22,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,877 INFO L120 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 [2019-10-22 08:54:22,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,880 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,883 INFO L120 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 [2019-10-22 08:54:22,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,886 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,890 INFO L120 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 [2019-10-22 08:54:22,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,900 INFO L120 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 [2019-10-22 08:54:22,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,915 INFO L120 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 [2019-10-22 08:54:22,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,918 INFO L120 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 [2019-10-22 08:54:22,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,936 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:23,039 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:23,141 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:54:23,141 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:23,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:23,146 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:23,146 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:23,147 INFO L512 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 [] [2019-10-22 08:54:23,163 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:54:23,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,238 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 [2019-10-22 08:54:23,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-10-22 08:54:23,269 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. [2019-10-22 08:54:23,270 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 [2019-10-22 08:54:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-10-22 08:54:23,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:23,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:54:23,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:54:23,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-10-22 08:54:23,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-10-22 08:54:23,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:23,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:23,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:23,276 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,276 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,277 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,277 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:23,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:23,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:23 BoogieIcfgContainer [2019-10-22 08:54:23,283 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:23,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:23,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:23,284 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:23,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:20" (3/4) ... [2019-10-22 08:54:23,288 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:23,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:23,289 INFO L168 Benchmark]: Toolchain (without parser) took 3697.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,290 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:23,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.54 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,291 INFO L168 Benchmark]: Boogie Preprocessor took 32.87 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. [2019-10-22 08:54:23,291 INFO L168 Benchmark]: RCFGBuilder took 288.48 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,292 INFO L168 Benchmark]: BuchiAutomizer took 2699.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,292 INFO L168 Benchmark]: Witness Printer took 4.36 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. [2019-10-22 08:54:23,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.54 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.87 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 288.48 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2699.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 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. * 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 2.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 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: inital254 mio100 ax111 hnf101 lsp86 ukn64 mio100 lsp56 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf137 smp78 tf100 neg96 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...