./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/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 64bit --witnessprinter.graph.data.programhash 0e5de97577f46d865036abdb75ab0d17479e10b3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:01:21,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:21,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:21,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:21,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:21,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:21,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:21,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:21,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:21,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:21,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:21,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:21,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:21,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:21,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:21,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:21,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:21,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:21,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:21,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:21,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:21,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:21,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:21,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:21,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:21,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:21,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:21,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:21,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:21,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:21,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:21,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:21,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:21,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:21,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:21,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:21,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:21,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:21,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:21,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:21,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:21,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:21,686 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:21,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:21,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:21,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:21,691 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:21,691 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:21,691 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:21,692 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:21,692 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:21,692 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:21,692 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:21,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:21,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:21,694 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:21,694 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:21,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:21,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:21,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:21,694 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:21,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:21,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:21,695 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:21,696 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:21,697 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_dfed0051-288b-47ff-a07d-ddf81eb2e113/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e5de97577f46d865036abdb75ab0d17479e10b3 [2019-10-22 09:01:21,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:21,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:21,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:21,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:21,735 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:21,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2019-10-22 09:01:21,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/data/8b75bd564/e0e738dbce9243fea6af7bc1812b357a/FLAG95a79e258 [2019-10-22 09:01:22,136 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:22,137 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2019-10-22 09:01:22,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/data/8b75bd564/e0e738dbce9243fea6af7bc1812b357a/FLAG95a79e258 [2019-10-22 09:01:22,149 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/bin/uautomizer/data/8b75bd564/e0e738dbce9243fea6af7bc1812b357a [2019-10-22 09:01:22,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:22,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:22,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:22,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:22,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:22,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e671e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,164 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:22,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:22,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,363 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:22,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,449 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:22,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22 WrapperNode [2019-10-22 09:01:22,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:22,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:22,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:22,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:22,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:22,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:22,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:22,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:22,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfed0051-288b-47ff-a07d-ddf81eb2e113/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 09:01:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:01:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-10-22 09:01:22,543 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-10-22 09:01:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-10-22 09:01:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-10-22 09:01:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:22,695 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:22,696 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 09:01:22,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22 BoogieIcfgContainer [2019-10-22 09:01:22,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:22,697 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:22,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:22,701 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:22,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:22,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:22" (1/3) ... [2019-10-22 09:01:22,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75964d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:22,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (2/3) ... [2019-10-22 09:01:22,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75964d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:22,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22" (3/3) ... [2019-10-22 09:01:22,705 INFO L371 chiAutomizerObserver]: Analyzing ICFG mutual_simple2.i [2019-10-22 09:01:22,744 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:22,744 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:22,744 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:22,744 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:22,744 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:22,744 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:22,745 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:22,745 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:22,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:01:22,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:22,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:22,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:22,786 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:01:22,786 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,786 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:22,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:01:22,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:22,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:22,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:22,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:01:22,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,796 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet9; 16#L44true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 15#fENTRYtrue [2019-10-22 09:01:22,796 INFO L793 eck$LassoCheckResult]: Loop: 15#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4); 17#L14true assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4; 4#L21true call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset);< 13#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4); 14#L27true assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset; 5#L33true call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset);< 15#fENTRYtrue [2019-10-22 09:01:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 43767, now seen corresponding path program 1 times [2019-10-22 09:01:22,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399481289] [2019-10-22 09:01:22,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 891860259, now seen corresponding path program 1 times [2019-10-22 09:01:22,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455915426] [2019-10-22 09:01:22,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:23,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -306262119, now seen corresponding path program 1 times [2019-10-22 09:01:23,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888696209] [2019-10-22 09:01:23,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:23,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:23,299 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-22 09:01:23,674 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-22 09:01:24,113 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-10-22 09:01:24,363 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-10-22 09:01:24,607 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:24,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:24,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:24,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:24,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:24,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:24,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:24,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:24,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: mutual_simple2.i_Iteration1_Lasso [2019-10-22 09:01:24,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:24,610 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:24,639 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 09:01:24,644 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 09:01:24,646 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 09:01:24,649 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 09:01:24,650 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 09:01:24,654 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 09:01:24,656 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 09:01:24,659 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 09:01:24,660 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 09:01:24,666 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 09:01:24,668 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 09:01:24,671 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 09:01:24,674 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 09:01:24,677 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 09:01:24,679 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 09:01:24,681 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 09:01:24,682 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 09:01:24,684 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 09:01:24,687 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 09:01:24,689 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 09:01:24,692 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 09:01:24,694 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 09:01:24,696 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 09:01:24,699 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 09:01:24,701 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 09:01:24,704 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 09:01:24,706 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 09:01:24,845 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 09:01:24,846 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 09:01:24,848 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 09:01:24,850 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 09:01:24,853 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 09:01:24,855 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 09:01:24,856 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 09:01:24,858 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 09:01:24,862 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 09:01:24,864 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 09:01:24,866 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 09:01:24,868 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 09:01:24,871 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 09:01:24,873 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 09:01:25,348 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:25,354 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:25,357 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 09:01:25,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,367 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 09:01:25,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,372 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 09:01:25,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,376 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 09:01:25,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,378 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,379 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 09:01:25,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,383 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 09:01:25,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,384 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,386 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 09:01:25,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,390 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 09:01:25,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,392 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,394 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 09:01:25,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:25,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:25,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,404 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 09:01:25,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,409 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 09:01:25,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,416 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 09:01:25,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,419 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 09:01:25,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,426 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 09:01:25,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,427 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,438 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 09:01:25,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,439 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,445 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 09:01:25,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,448 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 09:01:25,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,450 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 09:01:25,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,459 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 09:01:25,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,460 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,461 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 09:01:25,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:25,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:25,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,471 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 09:01:25,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,475 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,475 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,476 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 09:01:25,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,478 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 09:01:25,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,482 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 09:01:25,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,484 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,484 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,486 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 09:01:25,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,489 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 09:01:25,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:25,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:25,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:25,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,494 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 09:01:25,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,497 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:25,499 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:25,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,522 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 09:01:25,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:25,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:25,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:25,536 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 09:01:25,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:25,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:25,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:25,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:25,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:25,538 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:25,549 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:25,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:25,556 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:25,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:25,559 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:25,560 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:25,560 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2019-10-22 09:01:25,574 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:01:25,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:25,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-22 09:01:25,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:25,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 09:01:25,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:25,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:25,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:25,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-10-22 09:01:25,754 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 09:01:25,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-10-22 09:01:25,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 7 states. [2019-10-22 09:01:25,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 7 states. Result 47 states and 53 transitions. Complement of second has 22 states. [2019-10-22 09:01:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:01:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-10-22 09:01:25,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 09:01:25,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:25,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 09:01:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-10-22 09:01:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:25,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2019-10-22 09:01:25,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:25,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2019-10-22 09:01:25,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:25,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:25,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:25,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:25,986 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:25,986 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:25,986 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:25,986 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:25,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:25,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:25,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:25,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:25 BoogieIcfgContainer [2019-10-22 09:01:25,994 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:25,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:25,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:25,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:25,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22" (3/4) ... [2019-10-22 09:01:25,998 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:25,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:26,000 INFO L168 Benchmark]: Toolchain (without parser) took 3847.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.4 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 137.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:26,001 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:26,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 948.5 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:26,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.06 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. [2019-10-22 09:01:26,003 INFO L168 Benchmark]: Boogie Preprocessor took 14.61 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. [2019-10-22 09:01:26,003 INFO L168 Benchmark]: RCFGBuilder took 202.47 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:26,004 INFO L168 Benchmark]: BuchiAutomizer took 3296.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 89.3 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:26,004 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:26,007 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 948.5 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.06 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 14.61 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. * RCFGBuilder took 202.47 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3296.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 89.3 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.3 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 11 SDslu, 20 SDs, 0 SdLazy, 64 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf100 lsp94 ukn62 mio100 lsp25 div100 bol100 ite100 ukn100 eq160 hnf98 smp100 dnf280 smp91 tf100 neg88 sie147 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...