./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.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_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/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 df4500f5696d99ca846c8b1d02ff521622ca4836 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:37:40,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:37:40,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:37:40,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:37:40,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:37:40,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:37:40,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:37:40,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:37:40,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:37:40,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:37:40,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:37:40,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:37:40,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:37:40,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:37:40,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:37:40,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:37:40,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:37:40,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:37:40,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:37:40,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:37:40,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:37:40,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:37:40,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:37:40,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:37:40,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:37:40,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:37:40,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:37:40,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:37:40,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:37:40,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:37:40,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:37:40,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:37:40,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:37:40,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:37:40,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:37:40,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:37:40,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:37:40,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:37:40,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:37:40,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:37:40,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:37:40,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:37:40,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:37:40,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:37:40,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:37:40,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:37:40,666 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:37:40,666 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:37:40,666 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:37:40,666 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:37:40,666 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:37:40,667 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:37:40,667 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:37:40,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:37:40,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:37:40,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:37:40,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:37:40,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:37:40,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:37:40,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:37:40,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:37:40,669 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:37:40,669 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:37:40,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:37:40,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:37:40,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:37:40,670 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:37:40,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:37:40,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:37:40,671 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:37:40,671 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:37:40,671 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_85a1a050-b8e4-4751-bfe9-8105a4436a18/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 -> df4500f5696d99ca846c8b1d02ff521622ca4836 [2019-11-15 23:37:40,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:37:40,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:37:40,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:37:40,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:37:40,717 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:37:40,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i [2019-11-15 23:37:40,768 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/data/88452c53f/5767b4462b5849a6b7ff1750a35b1942/FLAGaeb7f158a [2019-11-15 23:37:41,259 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:37:41,260 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca.i [2019-11-15 23:37:41,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/data/88452c53f/5767b4462b5849a6b7ff1750a35b1942/FLAGaeb7f158a [2019-11-15 23:37:41,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/bin/uautomizer/data/88452c53f/5767b4462b5849a6b7ff1750a35b1942 [2019-11-15 23:37:41,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:37:41,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:37:41,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:41,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:37:41,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:37:41,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:41" (1/1) ... [2019-11-15 23:37:41,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b7d292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:41, skipping insertion in model container [2019-11-15 23:37:41,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:41" (1/1) ... [2019-11-15 23:37:41,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:37:41,804 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:37:42,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:42,122 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:37:42,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:42,225 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:37:42,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42 WrapperNode [2019-11-15 23:37:42,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:42,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:37:42,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:37:42,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:37:42,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:37:42,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:37:42,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:37:42,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:37:42,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... [2019-11-15 23:37:42,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:37:42,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:37:42,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:37:42,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:37:42,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85a1a050-b8e4-4751-bfe9-8105a4436a18/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-15 23:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:37:42,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:37:42,686 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:37:42,686 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:37:42,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:42 BoogieIcfgContainer [2019-11-15 23:37:42,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:37:42,688 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:37:42,688 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:37:42,690 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:37:42,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:42,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:37:41" (1/3) ... [2019-11-15 23:37:42,692 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eb535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:37:42, skipping insertion in model container [2019-11-15 23:37:42,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:42,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:42" (2/3) ... [2019-11-15 23:37:42,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eb535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:37:42, skipping insertion in model container [2019-11-15 23:37:42,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:42,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:42" (3/3) ... [2019-11-15 23:37:42,694 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.09_assume-alloca.i [2019-11-15 23:37:42,734 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:37:42,734 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:37:42,734 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:37:42,734 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:37:42,734 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:37:42,735 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:37:42,735 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:37:42,735 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:37:42,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:37:42,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:37:42,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:42,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:42,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:37:42,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:37:42,772 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:37:42,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:37:42,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:37:42,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:42,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:42,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:37:42,774 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:37:42,781 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 11#L555true assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 5#L558-5true [2019-11-15 23:37:42,781 INFO L793 eck$LassoCheckResult]: Loop: 5#L558-5true call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 8#L558-1true assume !test_fun_#t~short11; 12#L558-3true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L559true assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 5#L558-5true [2019-11-15 23:37:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:37:42,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:42,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732372974] [2019-11-15 23:37:42,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:42,950 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2019-11-15 23:37:42,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:42,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701834427] [2019-11-15 23:37:42,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:43,001 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-15 23:37:43,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701834427] [2019-11-15 23:37:43,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:43,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:43,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534580749] [2019-11-15 23:37:43,006 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:37:43,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:43,018 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-11-15 23:37:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:43,045 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-15 23:37:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:43,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 23:37:43,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:37:43,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2019-11-15 23:37:43,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:37:43,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:37:43,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2019-11-15 23:37:43,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:37:43,053 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-15 23:37:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2019-11-15 23:37:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:37:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:37:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-11-15 23:37:43,076 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-15 23:37:43,076 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-15 23:37:43,076 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:37:43,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2019-11-15 23:37:43,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:37:43,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:43,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:43,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:37:43,077 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:37:43,078 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L555 assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 36#L558-5 [2019-11-15 23:37:43,078 INFO L793 eck$LassoCheckResult]: Loop: 36#L558-5 call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 37#L558-1 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9; 39#L558-3 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L559 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 36#L558-5 [2019-11-15 23:37:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:43,078 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 23:37:43,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:43,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900644654] [2019-11-15 23:37:43,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2019-11-15 23:37:43,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:43,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830932733] [2019-11-15 23:37:43,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2019-11-15 23:37:43,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:43,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340007030] [2019-11-15 23:37:43,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:43,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:43,440 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-15 23:37:43,987 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-11-15 23:37:44,190 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 23:37:44,207 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:37:44,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:37:44,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:37:44,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:37:44,209 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:37:44,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:37:44,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:37:44,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:37:44,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.09_assume-alloca.i_Iteration2_Lasso [2019-11-15 23:37:44,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:37:44,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:37:44,248 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-15 23:37:44,253 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-15 23:37:44,256 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-15 23:37:44,258 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-15 23:37:44,261 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-15 23:37:44,264 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-15 23:37:44,268 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-15 23:37:44,271 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-15 23:37:44,275 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-15 23:37:44,279 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-15 23:37:44,282 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-15 23:37:44,284 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-15 23:37:44,294 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-15 23:37:44,298 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-15 23:37:44,303 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-15 23:37:44,305 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-15 23:37:44,308 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-15 23:37:44,310 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-15 23:37:44,781 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-15 23:37:44,953 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:37:44,953 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-15 23:37:44,957 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-15 23:37:44,962 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-15 23:37:44,964 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-15 23:37:45,808 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 23:37:45,929 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:37:45,933 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:37:45,935 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-15 23:37:45,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,943 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-15 23:37:45,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,946 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-15 23:37:45,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,948 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,948 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,950 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-15 23:37:45,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,953 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-15 23:37:45,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,955 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,956 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-15 23:37:45,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,958 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,958 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,960 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-15 23:37:45,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,961 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,963 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-15 23:37:45,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:45,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:45,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,969 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-15 23:37:45,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,973 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-15 23:37:45,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,976 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-15 23:37:45,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:45,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:45,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:45,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,979 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-15 23:37:45,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:45,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:45,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,986 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-15 23:37:45,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,988 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:45,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:45,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,993 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-15 23:37:45,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:45,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:45,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:45,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:45,996 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:45,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:45,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:45,999 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-15 23:37:46,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:46,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:46,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:46,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:46,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:46,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:46,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:46,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:46,002 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-15 23:37:46,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:46,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:46,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:46,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:46,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:46,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:46,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:46,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:46,005 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-15 23:37:46,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:46,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:46,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:46,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:46,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:46,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:46,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:46,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:46,008 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-15 23:37:46,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:46,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:46,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:46,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:46,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:46,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:46,065 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:37:46,100 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:37:46,100 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:37:46,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:37:46,104 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:37:46,104 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:37:46,105 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2019-11-15 23:37:46,182 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 23:37:46,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:37:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:46,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:37:46,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:46,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:37:46,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:46,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:46,322 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-15 23:37:46,324 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:37:46,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-11-15 23:37:46,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 11 states and 12 transitions. Complement of second has 8 states. [2019-11-15 23:37:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:37:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:37:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-15 23:37:46,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 23:37:46,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:46,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:37:46,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:46,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2019-11-15 23:37:46,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:46,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-15 23:37:46,384 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:37:46,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-11-15 23:37:46,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:37:46,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:37:46,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:37:46,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:37:46,385 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:46,385 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:46,385 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:46,385 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:37:46,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:37:46,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:37:46,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:37:46,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:37:46 BoogieIcfgContainer [2019-11-15 23:37:46,391 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:37:46,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:37:46,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:37:46,392 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:37:46,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:42" (3/4) ... [2019-11-15 23:37:46,396 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:37:46,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:37:46,397 INFO L168 Benchmark]: Toolchain (without parser) took 4656.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.4 MB in the beginning and 878.3 MB in the end (delta: 65.1 MB). Peak memory consumption was 202.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:46,398 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:46,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:46,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 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-15 23:37:46,400 INFO L168 Benchmark]: Boogie Preprocessor took 44.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:46,400 INFO L168 Benchmark]: RCFGBuilder took 360.50 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-15 23:37:46,401 INFO L168 Benchmark]: BuchiAutomizer took 3703.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.3 MB in the end (delta: 214.5 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:46,401 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 878.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:46,404 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.47 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 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 44.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 360.50 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 3703.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.3 MB in the end (delta: 214.5 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 878.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 4 SDslu, 9 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital304 mio100 ax105 hnf100 lsp91 ukn67 mio100 lsp34 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...