./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.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_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i -s /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/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 570a3560ecb7b29b974852ea58d8cc903e7c487d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:04:05,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:04:05,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:04:05,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:04:05,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:04:05,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:04:05,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:04:05,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:04:05,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:04:05,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:04:05,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:04:05,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:04:05,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:04:05,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:04:05,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:04:05,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:04:05,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:04:05,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:04:05,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:04:05,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:04:05,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:04:05,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:04:05,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:04:05,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:04:05,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:04:05,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:04:05,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:04:05,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:04:05,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:04:05,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:04:05,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:04:05,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:04:05,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:04:05,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:04:05,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:04:05,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:04:05,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:04:05,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:04:05,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:04:05,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:04:05,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:04:05,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:04:05,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:04:05,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:04:05,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:04:05,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:04:05,215 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:04:05,215 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:04:05,215 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:04:05,215 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:04:05,215 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:04:05,216 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:04:05,216 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:04:05,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:04:05,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:04:05,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:04:05,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:04:05,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:04:05,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:04:05,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:04:05,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:04:05,219 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:04:05,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:04:05,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:04:05,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:04:05,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:04:05,220 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:04:05,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:04:05,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:04:05,221 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:04:05,222 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:04:05,224 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_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2019-11-15 22:04:05,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:04:05,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:04:05,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:04:05,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:04:05,271 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:04:05,272 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-11-15 22:04:05,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/data/7597f8505/b0b7b87a4a6e4b1eb06f68c3e3008fc3/FLAGe66cf28fa [2019-11-15 22:04:05,705 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:04:05,706 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-11-15 22:04:05,711 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/data/7597f8505/b0b7b87a4a6e4b1eb06f68c3e3008fc3/FLAGe66cf28fa [2019-11-15 22:04:05,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/data/7597f8505/b0b7b87a4a6e4b1eb06f68c3e3008fc3 [2019-11-15 22:04:05,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:04:05,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:04:05,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:05,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:04:05,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:04:05,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:05" (1/1) ... [2019-11-15 22:04:05,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e0ef80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:05, skipping insertion in model container [2019-11-15 22:04:05,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:05" (1/1) ... [2019-11-15 22:04:05,750 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:04:05,768 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:04:05,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:05,972 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:04:05,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:06,007 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:04:06,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06 WrapperNode [2019-11-15 22:04:06,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:06,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:06,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:04:06,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:04:06,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:04:06,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:04:06,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:04:06,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:04:06,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... [2019-11-15 22:04:06,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:04:06,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:04:06,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:04:06,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:04:06,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/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 22:04:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:04:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 22:04:06,124 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 22:04:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:04:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:04:06,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:04:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:04:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:04:06,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:04:06,422 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:04:06,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:06 BoogieIcfgContainer [2019-11-15 22:04:06,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:04:06,424 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:04:06,424 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:04:06,427 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:04:06,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:04:06,428 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:04:05" (1/3) ... [2019-11-15 22:04:06,429 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b85c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:04:06, skipping insertion in model container [2019-11-15 22:04:06,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:04:06,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:06" (2/3) ... [2019-11-15 22:04:06,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b85c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:04:06, skipping insertion in model container [2019-11-15 22:04:06,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:04:06,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:06" (3/3) ... [2019-11-15 22:04:06,434 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D.i [2019-11-15 22:04:06,487 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:04:06,487 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:04:06,487 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:04:06,487 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:04:06,488 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:04:06,488 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:04:06,488 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:04:06,488 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:04:06,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:04:06,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:04:06,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:06,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:06,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:04:06,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:06,534 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:04:06,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:04:06,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:04:06,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:06,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:06,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:04:06,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:06,543 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L30-3true [2019-11-15 22:04:06,544 INFO L793 eck$LassoCheckResult]: Loop: 7#L30-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L30-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 7#L30-3true [2019-11-15 22:04:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 22:04:06,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:06,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637739684] [2019-11-15 22:04:06,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:06,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:06,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:06,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-11-15 22:04:06,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:06,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506773648] [2019-11-15 22:04:06,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:06,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:06,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:06,865 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 22:04:06,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506773648] [2019-11-15 22:04:06,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:06,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:04:06,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808897190] [2019-11-15 22:04:06,874 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:04:06,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:04:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:04:06,887 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-11-15 22:04:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:07,115 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-15 22:04:07,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:04:07,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-15 22:04:07,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:04:07,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-11-15 22:04:07,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:04:07,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:04:07,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-15 22:04:07,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:04:07,139 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 22:04:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-15 22:04:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 22:04:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 22:04:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 22:04:07,171 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 22:04:07,171 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 22:04:07,171 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:04:07,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-15 22:04:07,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:04:07,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:07,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:07,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:04:07,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:07,174 INFO L791 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 70#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 65#L30-3 [2019-11-15 22:04:07,174 INFO L793 eck$LassoCheckResult]: Loop: 65#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 66#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 67#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 59#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 62#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 60#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 59#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 62#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 71#recFINAL assume true; 73#recEXIT >#42#return; 68#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 69#recFINAL assume true; 74#recEXIT >#44#return; 63#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 64#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 65#L30-3 [2019-11-15 22:04:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-15 22:04:07,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:07,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679035795] [2019-11-15 22:04:07,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-11-15 22:04:07,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:07,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096057942] [2019-11-15 22:04:07,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-11-15 22:04:07,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:07,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060807857] [2019-11-15 22:04:07,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:07,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:07,384 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:07,937 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-11-15 22:04:08,200 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 22:04:08,330 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 22:04:08,924 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2019-11-15 22:04:09,122 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:04:09,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:04:09,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:04:09,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:04:09,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:04:09,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:04:09,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:04:09,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:04:09,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration2_Lasso [2019-11-15 22:04:09,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:04:09,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:04:09,140 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 22:04:09,145 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 22:04:09,147 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 22:04:09,148 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 22:04:09,157 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 22:04:09,161 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 22:04:09,164 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 22:04:09,166 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 22:04:09,432 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 22:04:09,432 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 22:04:09,435 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 22:04:09,794 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-15 22:04:09,862 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:04:09,866 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:04:09,868 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 22:04:09,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,873 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,875 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 22:04:09,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,878 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 22:04:09,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,880 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 22:04:09,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:09,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:09,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,887 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 22:04:09,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,889 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 22:04:09,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:09,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:09,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,895 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 22:04:09,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,898 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 22:04:09,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:09,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:09,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,916 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 22:04:09,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:09,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,918 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:09,918 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:09,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:09,919 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 22:04:09,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:09,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:09,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:09,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:09,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:09,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:09,938 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:04:09,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:04:09,944 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:04:09,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:04:09,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:04:09,948 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:04:09,949 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-15 22:04:09,972 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:04:09,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:04:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:10,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:04:10,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:10,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:04:10,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:10,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:10,117 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-15 22:04:10,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:10,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:10,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:04:10,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:10,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:10,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:10,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-11-15 22:04:10,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:04:10,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:10,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:10,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:10,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-11-15 22:04:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:04:10,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 22:04:10,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 22:04:10,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-11-15 22:04:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 22:04:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:04:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-11-15 22:04:10,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-15 22:04:10,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:10,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-15 22:04:10,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:10,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-11-15 22:04:10,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:10,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-11-15 22:04:10,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 22:04:10,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-11-15 22:04:10,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-15 22:04:10,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 22:04:10,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-15 22:04:10,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:04:10,365 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 22:04:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-15 22:04:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-15 22:04:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 22:04:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-11-15 22:04:10,372 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 22:04:10,373 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 22:04:10,373 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:04:10,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-11-15 22:04:10,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 22:04:10,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:10,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:10,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:10,376 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:04:10,376 INFO L791 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 273#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 274#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 262#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 280#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 263#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 264#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 296#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 248#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-11-15 22:04:10,376 INFO L793 eck$LassoCheckResult]: Loop: 246#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 249#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 247#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-11-15 22:04:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-11-15 22:04:10,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:10,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805618601] [2019-11-15 22:04:10,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-11-15 22:04:10,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:10,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731739884] [2019-11-15 22:04:10,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-11-15 22:04:10,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:10,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445258724] [2019-11-15 22:04:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:10,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:10,627 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-15 22:04:10,921 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 22:04:11,273 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 22:04:11,697 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-11-15 22:04:11,817 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:04:11,819 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:04:11,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:04:11,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:04:11,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:04:11,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:04:11,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:04:11,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:04:11,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:04:11,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration3_Lasso [2019-11-15 22:04:11,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:04:11,821 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:04:11,825 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 22:04:11,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,840 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 22:04:11,842 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 22:04:11,844 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 22:04:11,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,851 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 22:04:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,857 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 22:04:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,861 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 22:04:11,863 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 22:04:11,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:11,875 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 22:04:11,880 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 22:04:11,882 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 22:04:12,017 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 22:04:12,020 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 22:04:12,021 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 22:04:12,023 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 22:04:12,025 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 22:04:12,026 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 22:04:12,027 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 22:04:12,029 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 22:04:12,030 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 22:04:12,033 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 22:04:12,403 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 22:04:12,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:04:12,470 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:04:12,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:04:12,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,472 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,472 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,473 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,474 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 22:04:12,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,475 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,477 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 22:04:12,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,478 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,479 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 22:04:12,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:04:12,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,483 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,483 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,484 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 22:04:12,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,485 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,486 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,487 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 22:04:12,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:04:12,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,492 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 22:04:12,492 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,494 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:12,494 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:12,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,496 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 22:04:12,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,498 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 22:04:12,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,501 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 22:04:12,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,504 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 22:04:12,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,508 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 22:04:12,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,511 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 22:04:12,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,512 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,514 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 22:04:12,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,521 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,522 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,524 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 22:04:12,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,526 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 22:04:12,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,533 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 22:04:12,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:04:12,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:12,539 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:12,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,544 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 22:04:12,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,548 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 22:04:12,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,552 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 22:04:12,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,555 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 22:04:12,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:12,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:12,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:12,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,562 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 22:04:12,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:12,571 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:12,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:12,584 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 22:04:12,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:12,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:12,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:12,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:12,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:12,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:12,603 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:04:12,620 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:04:12,620 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:04:12,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:04:12,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:04:12,625 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:04:12,625 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-11-15 22:04:12,632 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 22:04:12,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:04:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:12,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:04:12,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:12,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:04:12,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:12,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:12,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 22:04:12,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:12,779 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 22:04:12,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:12,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 22:04:12,810 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 22:04:12,810 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 22:04:12,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 22:04:12,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-11-15 22:04:12,893 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 22:04:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:04:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-15 22:04:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 22:04:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 22:04:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 22:04:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:12,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-11-15 22:04:12,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 22:04:12,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-11-15 22:04:12,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-15 22:04:12,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-15 22:04:12,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-11-15 22:04:12,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:04:12,905 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-11-15 22:04:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-11-15 22:04:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-15 22:04:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 22:04:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-11-15 22:04:12,914 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 22:04:12,914 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 22:04:12,914 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:04:12,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-11-15 22:04:12,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 22:04:12,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:12,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:12,918 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:12,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:12,918 INFO L791 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 485#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 487#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 552#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 527#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 550#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 496#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 548#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 556#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 555#recFINAL assume true; 538#recEXIT >#42#return; 535#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 533#recFINAL assume true; 526#recEXIT >#44#return; 481#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 482#L38-3 [2019-11-15 22:04:12,919 INFO L793 eck$LassoCheckResult]: Loop: 482#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 517#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 534#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 532#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 513#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 525#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 531#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 514#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 525#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 531#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 512#recFINAL assume true; 515#recEXIT >#42#return; 524#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 530#recFINAL assume true; 523#recEXIT >#44#return; 521#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 482#L38-3 [2019-11-15 22:04:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-11-15 22:04:12,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:12,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467872634] [2019-11-15 22:04:12,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:12,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:12,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:04:13,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467872634] [2019-11-15 22:04:13,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657629714] [2019-11-15 22:04:13,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11feeb03-5f4e-4ac5-83bc-bb639a1e1a38/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:13,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:04:13,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:13,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:13,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 46 [2019-11-15 22:04:13,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:13,247 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-15 22:04:13,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:13,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-11-15 22:04:13,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 22:04:13,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:13,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:13,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:13,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-15 22:04:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:13,306 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:13,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 22:04:13,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449124135] [2019-11-15 22:04:13,307 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:04:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-11-15 22:04:13,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:13,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966156910] [2019-11-15 22:04:13,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:13,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:13,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:13,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:13,662 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-15 22:04:14,228 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2019-11-15 22:04:14,333 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 22:04:14,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:04:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:04:14,334 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-11-15 22:04:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:14,444 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-15 22:04:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:04:14,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-11-15 22:04:14,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:04:14,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-11-15 22:04:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 22:04:14,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:04:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-11-15 22:04:14,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:04:14,451 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-11-15 22:04:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-11-15 22:04:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-15 22:04:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 22:04:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-15 22:04:14,458 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 22:04:14,458 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 22:04:14,459 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:04:14,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-15 22:04:14,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:04:14,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:04:14,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:04:14,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:14,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:04:14,461 INFO L791 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 755#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 739#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 740#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 750#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 762#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 768#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 769#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 752#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 766#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 772#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 771#recFINAL assume true; 765#recEXIT >#42#return; 764#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 763#recFINAL assume true; 761#recEXIT >#44#return; 737#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 738#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~ret12;havoc main_#t~mem14; 741#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 743#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 749#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 730#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 729#recENTRY [2019-11-15 22:04:14,461 INFO L793 eck$LassoCheckResult]: Loop: 729#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 731#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 732#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 729#recENTRY [2019-11-15 22:04:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-11-15 22:04:14,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:14,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469979455] [2019-11-15 22:04:14,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-11-15 22:04:14,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:14,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396987155] [2019-11-15 22:04:14,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,514 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-11-15 22:04:14,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:14,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814993269] [2019-11-15 22:04:14,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:14,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:04:14,562 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:04:14,699 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 22:04:15,334 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-15 22:04:16,831 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 229 DAG size of output: 191 [2019-11-15 22:04:17,148 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 22:04:17,432 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-15 22:04:17,616 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 22:04:17,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:04:17,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:04:17,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:04:17,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:04:17,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:04:17,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:04:17,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:04:17,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:04:17,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration5_Lasso [2019-11-15 22:04:17,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:04:17,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:04:17,622 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 22:04:17,640 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 22:04:17,642 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 22:04:17,643 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 22:04:17,645 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 22:04:17,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,648 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 22:04:17,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,652 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 22:04:17,653 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 22:04:17,655 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 22:04:17,657 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 22:04:17,664 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 22:04:17,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,667 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 22:04:17,669 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 22:04:17,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,672 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 22:04:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04:17,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04: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-15 22:04:17,690 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 22:04:17,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:04: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-15 22:04:17,695 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 22:04:17,697 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 22:04:17,842 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 22:04:17,929 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 22:04:17,931 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 22:04:17,932 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 22:04:17,933 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 22:04:17,935 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 22:04:17,936 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 22:04:17,937 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 22:04:17,938 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 22:04:18,562 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:04:18,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:04:18,580 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:04:18,580 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 22:04:18,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,583 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 22:04:18,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,585 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 22:04:18,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,587 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 22:04:18,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,588 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,589 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 22:04:18,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,591 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 22:04:18,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,593 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 22:04:18,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,595 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 22:04:18,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,596 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,596 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,597 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 22:04:18,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,599 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 22:04:18,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,601 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,607 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 22:04:18,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,610 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 22:04:18,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,613 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 22:04:18,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,615 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 22:04:18,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,620 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 22:04:18,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,622 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,623 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 22:04:18,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,624 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,625 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 22:04:18,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04: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-15 22:04:18,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,631 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 22:04:18,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,633 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 22:04:18,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04: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-15 22:04:18,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,641 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 22:04:18,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,645 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 22:04:18,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04: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-15 22:04:18,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,651 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 22:04:18,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04: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-15 22:04:18,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:04:18,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:04:18,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:04:18,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,655 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 22:04:18,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,657 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,658 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 22:04:18,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,667 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,667 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,682 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 22:04:18,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,684 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,688 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,691 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 22:04:18,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:04:18,701 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 22:04:18,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:04:18,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:04:18,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:04:18,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:04:18,703 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:04:18,703 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:04:18,723 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:04:18,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:04:18,731 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:04:18,731 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:04:18,732 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:04:18,732 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:04:18,732 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-11-15 22:04:18,743 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 22:04:18,744 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:04:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:18,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:04:18,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:18,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:04:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:18,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:04:18,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:18,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:18,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 22:04:18,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:18,904 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 22:04:18,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:18,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 22:04:18,915 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 22:04:18,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:04:18,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:04:18,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 22:04:18,993 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 22:04:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:04:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:04:18,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 22:04:18,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:18,994 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:04:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:19,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:04:19,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:19,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:04:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:19,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:04:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:19,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:19,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 22:04:19,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:19,137 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 22:04:19,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:19,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 22:04:19,148 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 22:04:19,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:04:19,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:04:19,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 22:04:19,200 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 22:04:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:04:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:04:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 22:04:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:19,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:04:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:19,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:04:19,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:19,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:04:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:19,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:04:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:19,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:19,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 22:04:19,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:19,365 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 22:04:19,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:19,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 22:04:19,388 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 22:04:19,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:04:19,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 22:04:19,486 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-11-15 22:04:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:04:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:04:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-15 22:04:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 22:04:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 22:04:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-15 22:04:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:04:19,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-11-15 22:04:19,491 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:04:19,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:04:19,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:04:19,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:04:19,491 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:04:19,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:04:19,491 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:04:19,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:04:19,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:04:19 BoogieIcfgContainer [2019-11-15 22:04:19,496 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:04:19,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:04:19,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:04:19,496 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:04:19,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:06" (3/4) ... [2019-11-15 22:04:19,500 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:04:19,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:04:19,501 INFO L168 Benchmark]: Toolchain (without parser) took 13768.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:19,501 INFO L168 Benchmark]: CDTParser took 0.17 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 22:04:19,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:19,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.04 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 22:04:19,503 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 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 22:04:19,503 INFO L168 Benchmark]: RCFGBuilder took 361.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:19,504 INFO L168 Benchmark]: BuchiAutomizer took 13072.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.5 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:04:19,504 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:04:19,507 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.17 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 271.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.04 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 21.03 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 361.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13072.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.5 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 62 SDslu, 150 SDs, 0 SdLazy, 243 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf100 lsp98 ukn38 mio100 lsp28 div100 bol100 ite100 ukn100 eq185 hnf89 smp98 dnf436 smp88 tf100 neg86 sie151 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...