./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/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i -s /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/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-10-22 08:54:11,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:11,319 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,321 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,321 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:11,321 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:11,321 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:11,321 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:11,321 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:11,322 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:11,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,323 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:11,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:11,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,324 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:11,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,325 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:11,326 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:11,326 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/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-10-22 08:54:11,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-10-22 08:54:11,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/data/61fcb9e9c/50a34e3a9c1945ffa1b5cb30e5ff524a/FLAGcf689a368 [2019-10-22 08:54:11,799 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-10-22 08:54:11,804 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/data/61fcb9e9c/50a34e3a9c1945ffa1b5cb30e5ff524a/FLAGcf689a368 [2019-10-22 08:54:12,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/data/61fcb9e9c/50a34e3a9c1945ffa1b5cb30e5ff524a [2019-10-22 08:54:12,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0dd891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,245 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,259 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,399 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,479 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-10-22 08:54:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-10-22 08:54:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:12,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:12,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,839 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:54:12,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:12,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:12,849 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:12,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:12,863 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6fdf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,863 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,864 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6fdf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,865 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D.i [2019-10-22 08:54:12,944 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:12,944 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:12,944 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:12,954 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:12,959 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:12,959 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:12,959 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:12,960 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:12,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:54:13,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:54:13,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,013 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:13,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:54:13,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:54:13,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,023 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-10-22 08:54:13,024 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~mem14;havoc main_#t~ret12; 7#L30-3true [2019-10-22 08:54:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-10-22 08:54:13,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290013821] [2019-10-22 08:54:13,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-10-22 08:54:13,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308141591] [2019-10-22 08:54:13,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308141591] [2019-10-22 08:54:13,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:13,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572284985] [2019-10-22 08:54:13,373 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:13,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:13,389 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-10-22 08:54:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,543 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-10-22 08:54:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:13,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-10-22 08:54:13,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:54:13,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-10-22 08:54:13,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:54:13,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:54:13,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-10-22 08:54:13,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,556 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 08:54:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-10-22 08:54:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:54:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:54:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-22 08:54:13,581 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 08:54:13,581 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 08:54:13,581 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:13,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-10-22 08:54:13,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:54:13,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,584 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-10-22 08:54:13,584 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~mem14;havoc main_#t~ret12; 65#L30-3 [2019-10-22 08:54:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-10-22 08:54:13,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306484892] [2019-10-22 08:54:13,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,611 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-10-22 08:54:13,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732294794] [2019-10-22 08:54:13,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-10-22 08:54:13,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266261686] [2019-10-22 08:54:13,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,771 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,203 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-10-22 08:54:14,407 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 08:54:15,019 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2019-10-22 08:54:15,189 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:15,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:15,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:15,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:15,190 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:15,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:15,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:15,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:15,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration2_Lasso [2019-10-22 08:54:15,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:15,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:15,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,446 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-22 08:54:15,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,776 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:15,781 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:15,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,808 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:15,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:15,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,818 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:15,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:15,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:15,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:15,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:15,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:15,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:15,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:15,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:15,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:15,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:15,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:15,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:15,852 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:15,852 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:15,867 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:15,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:15,873 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:15,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:15,877 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:15,877 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:15,878 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-10-22 08:54:15,886 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:54:15,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:15,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:54:15,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:16,020 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-10-22 08:54:16,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:16,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:16,035 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-10-22 08:54:16,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:16,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:16,044 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-10-22 08:54:16,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-10-22 08:54:16,058 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-10-22 08:54:16,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:16,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:16,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:16,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-10-22 08:54:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:54:16,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-10-22 08:54:16,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 08:54:16,233 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-10-22 08:54:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-10-22 08:54:16,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-10-22 08:54:16,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-10-22 08:54:16,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-10-22 08:54:16,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:16,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-10-22 08:54:16,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 08:54:16,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-10-22 08:54:16,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-10-22 08:54:16,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 08:54:16,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-10-22 08:54:16,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:16,243 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 08:54:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-10-22 08:54:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-10-22 08:54:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 08:54:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-10-22 08:54:16,250 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-10-22 08:54:16,250 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-10-22 08:54:16,250 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:16,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-10-22 08:54:16,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 08:54:16,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:16,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:16,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:16,253 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:16,253 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-10-22 08:54:16,254 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-10-22 08:54:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-10-22 08:54:16,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617758040] [2019-10-22 08:54:16,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-10-22 08:54:16,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454256965] [2019-10-22 08:54:16,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,304 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-10-22 08:54:16,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:16,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781282296] [2019-10-22 08:54:16,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:16,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:16,358 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:16,748 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-22 08:54:17,073 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-10-22 08:54:17,421 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-10-22 08:54:17,486 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:17,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:17,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:17,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:17,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:17,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:17,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:17,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:17,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration3_Lasso [2019-10-22 08:54:17,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:17,487 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:17,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54: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-10-22 08:54: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-10-22 08:54:17,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54: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-10-22 08:54:17,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54: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-10-22 08:54: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-10-22 08:54: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-10-22 08:54:17,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,935 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-10-22 08:54:17,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:17,994 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:17,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:17,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,026 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:18,026 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:18,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:18,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:18,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:18,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:18,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:18,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:18,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:18,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:18,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:18,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:18,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:18,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:18,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:18,108 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:18,109 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:18,121 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:18,132 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:18,132 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:18,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:18,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:18,137 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:18,138 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-10-22 08:54:18,141 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:18,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:18,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:18,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:18,224 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-10-22 08:54:18,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,251 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:54:18,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:54:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:18,264 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-10-22 08:54:18,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 08:54:18,335 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-10-22 08:54:18,336 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-10-22 08:54:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-10-22 08:54:18,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:54:18,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 08:54:18,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:54:18,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-10-22 08:54:18,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 08:54:18,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-10-22 08:54:18,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-10-22 08:54:18,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-10-22 08:54:18,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-10-22 08:54:18,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:18,345 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-10-22 08:54:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-10-22 08:54:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-10-22 08:54:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 08:54:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-10-22 08:54:18,354 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-22 08:54:18,354 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-22 08:54:18,354 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:18,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-10-22 08:54:18,356 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 08:54:18,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:18,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:18,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:18,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:18,357 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-10-22 08:54:18,357 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~mem14;havoc main_#t~ret12; 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-10-22 08:54:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-10-22 08:54:18,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067741651] [2019-10-22 08:54:18,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:18,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067741651] [2019-10-22 08:54:18,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637245458] [2019-10-22 08:54:18,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76a0ac03-22e5-4cbe-a86a-1dbd91461299/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-10-22 08:54:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 08:54:18,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:18,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:18,571 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-10-22 08:54:18,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,589 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-10-22 08:54:18,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-10-22 08:54:18,632 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-10-22 08:54:18,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:18,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:18,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-10-22 08:54:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:18,641 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:18,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-10-22 08:54:18,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025372781] [2019-10-22 08:54:18,642 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-10-22 08:54:18,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109381553] [2019-10-22 08:54:18,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,911 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-10-22 08:54:19,351 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2019-10-22 08:54:19,455 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 08:54:19,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:54:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:54:19,456 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-10-22 08:54:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:19,555 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-22 08:54:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:19,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-10-22 08:54:19,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:19,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-10-22 08:54:19,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:54:19,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:54:19,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-10-22 08:54:19,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:19,559 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-10-22 08:54:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-10-22 08:54:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-10-22 08:54:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:54:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-10-22 08:54:19,564 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 08:54:19,564 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 08:54:19,564 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:19,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-10-22 08:54:19,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:19,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:19,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:19,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:19,567 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:19,567 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~mem14;havoc main_#t~ret12; 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-10-22 08:54:19,567 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-10-22 08:54:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-10-22 08:54:19,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90467689] [2019-10-22 08:54:19,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,603 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,604 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-10-22 08:54:19,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400896282] [2019-10-22 08:54:19,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-10-22 08:54:19,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891832019] [2019-10-22 08:54:19,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,764 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-22 08:54:20,185 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-10-22 08:54:21,436 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 229 DAG size of output: 191 [2019-10-22 08:54:21,667 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-22 08:54:21,912 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-10-22 08:54:22,077 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-22 08:54:22,079 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:22,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:22,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:22,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:22,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:22,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:22,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:22,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration5_Lasso [2019-10-22 08:54:22,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:22,080 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:22,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,813 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:54:22,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:22,828 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:22,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,833 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,839 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,839 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,841 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,845 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,847 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,850 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,856 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,856 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,858 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,872 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,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-10-22 08:54:22,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,885 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,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-10-22 08:54:22,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,906 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,918 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:22,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:22,924 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:22,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:22,925 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:22,925 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:22,925 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-10-22 08:54:22,933 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 08:54:22,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:22,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:22,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:23,039 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-10-22 08:54:23,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,057 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:54:23,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:54:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,073 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-10-22 08:54:23,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:23,130 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-10-22 08:54:23,131 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-10-22 08:54:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:23,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 08:54:23,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,132 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:23,247 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-10-22 08:54:23,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,263 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:54:23,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:54:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,273 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-10-22 08:54:23,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:23,321 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-10-22 08:54:23,322 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-10-22 08:54:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 08:54:23,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 08:54:23,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,323 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:23,441 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-10-22 08:54:23,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,462 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:54:23,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:23,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:54:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,471 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-10-22 08:54:23,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:54:23,562 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-10-22 08:54:23,564 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-10-22 08:54:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-10-22 08:54:23,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 08:54:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-10-22 08:54:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 08:54:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-10-22 08:54:23,566 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-10-22 08:54:23,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:23,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:23,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:23,567 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,567 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,567 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,567 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:23,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,567 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:23,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:23 BoogieIcfgContainer [2019-10-22 08:54:23,573 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:23,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:23,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:23,574 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:23,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:23,577 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:23,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:23,578 INFO L168 Benchmark]: Toolchain (without parser) took 11348.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 941.8 MB in the beginning and 1.2 GB in the end (delta: -265.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,578 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:23,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.90 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,579 INFO L168 Benchmark]: Boogie Preprocessor took 19.18 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,580 INFO L168 Benchmark]: RCFGBuilder took 305.32 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,580 INFO L168 Benchmark]: BuchiAutomizer took 10732.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.9 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,580 INFO L168 Benchmark]: Witness Printer took 3.32 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-10-22 08:54:23,583 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.90 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.18 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 305.32 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10732.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.9 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 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 10.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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: 7ms 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...