./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.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/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.i -s /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/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 15c6db6bd14dffda34ad35d2a51204e1169327e8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:35:13,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:35:13,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:35:13,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:35:13,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:35:13,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:35:13,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:35:13,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:35:13,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:35:13,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:35:13,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:35:13,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:35:13,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:35:13,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:35:13,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:35:13,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:35:13,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:35:13,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:35:13,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:35:13,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:35:13,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:35:13,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:35:13,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:35:13,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:35:13,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:35:13,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:35:13,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:35:13,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:35:13,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:35:13,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:35:13,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:35:13,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:35:13,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:35:13,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:35:13,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:35:13,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:35:13,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:35:13,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:35:13,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:35:13,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:35:13,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:35:13,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:35:13,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:35:13,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:35:13,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:35:13,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:35:13,700 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:35:13,701 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:35:13,701 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:35:13,701 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:35:13,701 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:35:13,701 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:35:13,702 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:35:13,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:35:13,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:35:13,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:35:13,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:35:13,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:35:13,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:35:13,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:35:13,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:35:13,704 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:35:13,705 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:35:13,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:35:13,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:35:13,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:35:13,706 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:35:13,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:35:13,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:35:13,706 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:35:13,707 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:35:13,707 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/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/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 -> 15c6db6bd14dffda34ad35d2a51204e1169327e8 [2019-11-16 00:35:13,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:35:13,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:35:13,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:35:13,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:35:13,773 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:35:13,774 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.i [2019-11-16 00:35:13,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/data/1fb543f4f/09198bd5a9a54408b03b2cff3ba54da1/FLAG02b081f95 [2019-11-16 00:35:14,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:35:14,255 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.i [2019-11-16 00:35:14,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/data/1fb543f4f/09198bd5a9a54408b03b2cff3ba54da1/FLAG02b081f95 [2019-11-16 00:35:14,615 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/bin/uautomizer/data/1fb543f4f/09198bd5a9a54408b03b2cff3ba54da1 [2019-11-16 00:35:14,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:35:14,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:35:14,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:14,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:35:14,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:35:14,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ee5fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14, skipping insertion in model container [2019-11-16 00:35:14,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:35:14,643 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:35:14,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:14,847 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:35:14,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:35:14,873 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:35:14,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14 WrapperNode [2019-11-16 00:35:14,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:35:14,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:14,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:35:14,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:35:14,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:35:14,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:35:14,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:35:14,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:35:14,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... [2019-11-16 00:35:14,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:35:14,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:35:14,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:35:14,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:35:14,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_007089c1-a57f-45e6-9c01-38ebc4d6b5f7/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-11-16 00:35:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:35:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:35:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-16 00:35:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-16 00:35:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-16 00:35:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-16 00:35:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:35:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:35:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:35:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:35:15,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:35:15,167 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:35:15,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:15 BoogieIcfgContainer [2019-11-16 00:35:15,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:35:15,169 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:35:15,169 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:35:15,172 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:35:15,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:15,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:35:14" (1/3) ... [2019-11-16 00:35:15,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf7fa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:35:15, skipping insertion in model container [2019-11-16 00:35:15,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:15,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:14" (2/3) ... [2019-11-16 00:35:15,175 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bf7fa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:35:15, skipping insertion in model container [2019-11-16 00:35:15,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:35:15,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:15" (3/3) ... [2019-11-16 00:35:15,177 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex10.i [2019-11-16 00:35:15,219 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:35:15,219 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:35:15,219 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:35:15,220 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:35:15,220 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:35:15,220 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:35:15,220 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:35:15,220 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:35:15,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:35:15,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:35:15,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:15,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:15,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:35:15,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:35:15,265 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:35:15,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:35:15,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:35:15,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:35:15,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:35:15,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:35:15,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:35:15,275 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_#t~nondet10, 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;call write~int(main_#t~nondet10, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet10; 5#L49true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-11-16 00:35:15,276 INFO L793 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem1;havoc #t~mem2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 17#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4);call #t~mem6 := read~int(~q.base, ~q.offset, 4); 7#L31true assume !(#t~mem5 + #t~mem6 < 0);havoc #t~mem6;havoc #t~mem5; 18#L35true call f(~q.base, ~q.offset, ~p.base, ~p.offset);< 13#fENTRYtrue [2019-11-16 00:35:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 43766, now seen corresponding path program 1 times [2019-11-16 00:35:15,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:15,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011268592] [2019-11-16 00:35:15,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,425 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash 891830467, now seen corresponding path program 1 times [2019-11-16 00:35:15,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:15,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671683014] [2019-11-16 00:35:15,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,499 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1193795592, now seen corresponding path program 1 times [2019-11-16 00:35:15,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:15,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446000878] [2019-11-16 00:35:15,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:15,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:35:15,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:35:15,725 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-16 00:35:16,223 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-11-16 00:35:16,358 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:35:16,902 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-11-16 00:35:17,290 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-11-16 00:35:17,430 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:35:17,562 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:35:17,654 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:35:17,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:35:17,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:35:17,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:35:17,656 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:35:17,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:35:17,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:35:17,656 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:35:17,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex10.i_Iteration1_Lasso [2019-11-16 00:35:17,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:35:17,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:35:17,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,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-11-16 00:35:17,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-11-16 00:35:17,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-11-16 00:35:17,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-11-16 00:35:17,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:17,916 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-16 00:35:18,090 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-16 00:35:18,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:35:18,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:35:18,612 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:35:18,614 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-11-16 00:35:18,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,621 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-11-16 00:35:18,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,624 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-11-16 00:35:18,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,628 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-11-16 00:35:18,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,632 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-11-16 00:35:18,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,635 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-11-16 00:35:18,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,639 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-11-16 00:35:18,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,642 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-11-16 00:35:18,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,646 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-11-16 00:35:18,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,649 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-11-16 00:35:18,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,653 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-11-16 00:35:18,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,656 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-11-16 00:35:18,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,659 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,659 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,663 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-11-16 00:35:18,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,667 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-11-16 00:35:18,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,670 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-11-16 00:35:18,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,672 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,674 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-11-16 00:35:18,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,677 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-11-16 00:35:18,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,681 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-11-16 00:35:18,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,689 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-11-16 00:35:18,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,697 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-11-16 00:35:18,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,698 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,699 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-11-16 00:35:18,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,708 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-11-16 00:35:18,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,712 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-11-16 00:35:18,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,715 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-11-16 00:35:18,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,718 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-11-16 00:35:18,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,721 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-11-16 00:35:18,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,727 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-11-16 00:35:18,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,728 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,729 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,730 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-11-16 00:35:18,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,734 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-11-16 00:35:18,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:35:18,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:35:18,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:35:18,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,737 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-11-16 00:35:18,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,741 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,769 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-11-16 00:35:18,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,772 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,773 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,807 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-11-16 00:35:18,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,873 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-11-16 00:35:18,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,875 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:35:18,876 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:35:18,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,883 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:35:18,884 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:35:18,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:35:18,940 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-11-16 00:35:18,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:35:18,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:35:18,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:35:18,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:35:18,954 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:35:18,959 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:35:18,983 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:35:19,006 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:35:19,006 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:35:19,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:35:19,010 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:35:19,011 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:35:19,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1 + 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2019-11-16 00:35:19,031 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:35:19,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:35:19,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:35:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:35:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:19,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-16 00:35:19,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:19,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:19,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:35:19,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:19,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:19,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:19,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2019-11-16 00:35:19,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:19,336 INFO L567 ElimStorePlain]: treesize reduction 42, result has 56.3 percent of original size [2019-11-16 00:35:19,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:19,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2019-11-16 00:35:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:19,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:35:19,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 6 states. [2019-11-16 00:35:19,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 6 states. Result 46 states and 52 transitions. Complement of second has 20 states. [2019-11-16 00:35:19,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:35:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:35:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-11-16 00:35:19,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-16 00:35:19,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:19,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-16 00:35:19,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:19,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-11-16 00:35:19,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:35:19,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2019-11-16 00:35:19,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:35:19,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-11-16 00:35:19,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:35:19,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:35:19,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:35:19,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:35:19,651 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:35:19,651 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:35:19,651 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:35:19,651 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:35:19,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:35:19,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:35:19,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:35:19,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:35:19 BoogieIcfgContainer [2019-11-16 00:35:19,655 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:35:19,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:35:19,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:35:19,656 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:35:19,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:15" (3/4) ... [2019-11-16 00:35:19,659 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:35:19,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:35:19,661 INFO L168 Benchmark]: Toolchain (without parser) took 5042.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:35:19,661 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:35:19,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:19,662 INFO L168 Benchmark]: Boogie Procedure Inliner 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-11-16 00:35:19,662 INFO L168 Benchmark]: Boogie Preprocessor took 18.31 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-11-16 00:35:19,663 INFO L168 Benchmark]: RCFGBuilder took 242.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:19,663 INFO L168 Benchmark]: BuchiAutomizer took 4486.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:35:19,664 INFO L168 Benchmark]: Witness Printer took 3.86 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-11-16 00:35:19,666 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner 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. * Boogie Preprocessor took 18.31 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 242.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4486.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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[p][p] + unknown-#memory_int-unknown[q][q] and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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: 12 SDtfs, 12 SDslu, 22 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp97 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq164 hnf90 smp96 dnf101 smp98 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...