./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/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 32bit --witnessprinter.graph.data.programhash 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:59:30,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:59:30,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:59:30,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:59:30,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:59:30,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:59:30,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:59:30,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:59:30,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:59:30,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:59:30,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:59:30,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:59:30,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:59:30,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:59:30,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:59:30,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:59:30,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:59:30,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:59:30,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:59:30,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:59:30,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:59:30,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:59:30,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:59:30,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:59:30,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:59:30,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:59:30,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:59:30,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:59:30,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:59:30,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:59:30,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:59:30,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:59:30,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:59:30,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:59:30,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:59:30,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:59:30,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:59:30,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:59:30,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:59:30,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:59:30,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:59:30,707 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:59:30,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:59:30,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:59:30,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:59:30,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:59:30,724 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:59:30,724 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:59:30,724 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:59:30,724 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:59:30,724 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:59:30,725 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:59:30,725 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:59:30,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:59:30,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:59:30,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:59:30,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:59:30,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:59:30,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:59:30,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:59:30,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:59:30,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:59:30,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:59:30,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:59:30,727 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:59:30,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:59:30,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:59:30,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:59:30,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:59:30,728 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:59:30,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:59:30,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:59:30,729 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:59:30,730 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:59:30,730 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 [2019-11-15 20:59:30,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:59:30,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:59:30,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:59:30,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:59:30,769 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:59:30,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-15 20:59:30,818 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/data/4e4bc35d9/a63dbea145974da4ac28143fd4d955e2/FLAG1382f773a [2019-11-15 20:59:31,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:59:31,310 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-15 20:59:31,324 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/data/4e4bc35d9/a63dbea145974da4ac28143fd4d955e2/FLAG1382f773a [2019-11-15 20:59:31,337 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/data/4e4bc35d9/a63dbea145974da4ac28143fd4d955e2 [2019-11-15 20:59:31,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:59:31,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:59:31,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:59:31,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:59:31,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:59:31,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:59:31" (1/1) ... [2019-11-15 20:59:31,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dca4a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:31, skipping insertion in model container [2019-11-15 20:59:31,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:59:31" (1/1) ... [2019-11-15 20:59:31,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:59:31,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:59:31,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:59:31,900 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:59:31,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:59:32,058 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:59:32,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32 WrapperNode [2019-11-15 20:59:32,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:59:32,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:59:32,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:59:32,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:59:32,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:59:32,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:59:32,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:59:32,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:59:32,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... [2019-11-15 20:59:32,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:59:32,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:59:32,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:59:32,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:59:32,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:59:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:59:32,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:59:32,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:59:32,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:59:32,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:59:32,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 20:59:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:59:32,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:59:32,529 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:59:32,530 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-15 20:59:32,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:59:32 BoogieIcfgContainer [2019-11-15 20:59:32,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:59:32,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:59:32,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:59:32,534 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:59:32,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:59:32,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:59:31" (1/3) ... [2019-11-15 20:59:32,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c1ae063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:59:32, skipping insertion in model container [2019-11-15 20:59:32,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:59:32,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:59:32" (2/3) ... [2019-11-15 20:59:32,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c1ae063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:59:32, skipping insertion in model container [2019-11-15 20:59:32,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:59:32,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:59:32" (3/3) ... [2019-11-15 20:59:32,538 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2019-11-15 20:59:32,576 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:59:32,576 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:59:32,576 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:59:32,576 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:59:32,576 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:59:32,576 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:59:32,577 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:59:32,577 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:59:32,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:59:32,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:59:32,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:32,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:32,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:32,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:32,610 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:59:32,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:59:32,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:59:32,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:32,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:32,613 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:32,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:32,618 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 9#L521true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 7#L522true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 28#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 11#L530true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 18#L790true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 24#L791-3true [2019-11-15 20:59:32,618 INFO L793 eck$LassoCheckResult]: Loop: 24#L791-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 6#L791-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 24#L791-3true [2019-11-15 20:59:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2019-11-15 20:59:32,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:32,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882155149] [2019-11-15 20:59:32,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:32,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:32,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:32,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882155149] [2019-11-15 20:59:32,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:32,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:59:32,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056666319] [2019-11-15 20:59:32,817 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-15 20:59:32,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:32,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042944910] [2019-11-15 20:59:32,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:32,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:32,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:32,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:32,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:32,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:59:32,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:59:32,953 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-11-15 20:59:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:33,032 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-11-15 20:59:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:33,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-11-15 20:59:33,037 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-11-15 20:59:33,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-11-15 20:59:33,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-15 20:59:33,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-15 20:59:33,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-15 20:59:33,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:59:33,047 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-15 20:59:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-15 20:59:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-11-15 20:59:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:59:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 20:59:33,080 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:59:33,081 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:59:33,081 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:59:33,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 20:59:33,085 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:59:33,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:33,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:33,086 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:33,086 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:33,087 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 101#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 102#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 99#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 100#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 106#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 91#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 92#L791-3 [2019-11-15 20:59:33,087 INFO L793 eck$LassoCheckResult]: Loop: 92#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 98#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 92#L791-3 [2019-11-15 20:59:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2019-11-15 20:59:33,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:33,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675675894] [2019-11-15 20:59:33,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,164 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2019-11-15 20:59:33,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:33,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28740017] [2019-11-15 20:59:33,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2019-11-15 20:59:33,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:33,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836342274] [2019-11-15 20:59:33,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:33,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:33,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:33,605 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-15 20:59:33,729 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 20:59:33,737 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:59:33,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:59:33,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:59:33,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:59:33,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:59:33,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:59:33,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:59:33,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:59:33,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2019-11-15 20:59:33,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:59:33,740 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:59:33,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:33,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:34,105 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 20:59:34,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:34,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:34,880 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 20:59:34,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:59:34,918 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:59:34,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:34,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:34,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:34,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,931 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:34,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:34,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,943 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:34,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:34,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:34,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:34,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:34,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,970 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:34,970 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:34,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:34,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:34,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:34,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:34,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:34,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:34,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:34,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:34,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:34,988 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:34,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:34,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,005 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,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-11-15 20:59:35,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:35,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:35,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:35,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,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-11-15 20:59:35,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,025 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,055 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:35,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:35,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:35,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:35,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:35,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:35,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,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-11-15 20:59:35,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,119 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,120 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:35,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:35,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:35,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:35,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:35,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:35,142 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:35,142 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:35,230 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:59:35,265 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:59:35,266 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:59:35,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:59:35,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:59:35,270 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:59:35,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~2) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2019-11-15 20:59:35,295 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 20:59:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:35,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:59:35,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:35,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:59:35,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:35,365 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:59:35,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 20:59:35,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 6 states. [2019-11-15 20:59:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:59:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:59:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-15 20:59:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:59:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:59:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:59:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:35,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-15 20:59:35,419 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:59:35,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 24 states and 31 transitions. [2019-11-15 20:59:35,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 20:59:35,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 20:59:35,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-11-15 20:59:35,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:59:35,422 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-15 20:59:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-11-15 20:59:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 20:59:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:59:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-15 20:59:35,427 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-15 20:59:35,427 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-15 20:59:35,427 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:59:35,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-11-15 20:59:35,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:59:35,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:35,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:35,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:35,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:59:35,434 INFO L791 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 243#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 244#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 240#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 241#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 247#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 231#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 232#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 242#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 245#L766-3 [2019-11-15 20:59:35,434 INFO L793 eck$LassoCheckResult]: Loop: 245#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 225#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 226#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 235#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 237#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 245#L766-3 [2019-11-15 20:59:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2019-11-15 20:59:35,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:35,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232970334] [2019-11-15 20:59:35,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:35,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232970334] [2019-11-15 20:59:35,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:35,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:59:35,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677855412] [2019-11-15 20:59:35,507 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2019-11-15 20:59:35,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:35,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968210906] [2019-11-15 20:59:35,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:35,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:35,713 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 20:59:35,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:59:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:59:35,793 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-15 20:59:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:35,842 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-15 20:59:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:35,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-15 20:59:35,847 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-11-15 20:59:35,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-11-15 20:59:35,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 20:59:35,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 20:59:35,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-15 20:59:35,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:59:35,849 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 20:59:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-15 20:59:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-11-15 20:59:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 20:59:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-15 20:59:35,852 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 20:59:35,852 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 20:59:35,852 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:59:35,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-15 20:59:35,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:59:35,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:35,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:35,854 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:35,854 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:59:35,854 INFO L791 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 324#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 325#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 327#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 332#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 333#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 335#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 334#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 326#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 329#L766-3 [2019-11-15 20:59:35,854 INFO L793 eck$LassoCheckResult]: Loop: 329#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 307#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 308#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 317#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 319#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 329#L766-3 [2019-11-15 20:59:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2019-11-15 20:59:35,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:35,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856058183] [2019-11-15 20:59:35,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:35,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856058183] [2019-11-15 20:59:35,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:35,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:59:35,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610368482] [2019-11-15 20:59:35,902 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2019-11-15 20:59:35,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:35,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593177998] [2019-11-15 20:59:35,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:35,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:35,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:36,077 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 20:59:36,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:59:36,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:59:36,168 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-15 20:59:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:36,204 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-15 20:59:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:36,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-15 20:59:36,208 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:59:36,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2019-11-15 20:59:36,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 20:59:36,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 20:59:36,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2019-11-15 20:59:36,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:59:36,209 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-15 20:59:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2019-11-15 20:59:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 20:59:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:59:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-15 20:59:36,212 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 20:59:36,212 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 20:59:36,212 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:59:36,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-11-15 20:59:36,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:59:36,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:36,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:36,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:36,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:59:36,213 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 395#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 396#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 393#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 394#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 400#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 384#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 385#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 391#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 392#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 397#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 399#L766-3 [2019-11-15 20:59:36,213 INFO L793 eck$LassoCheckResult]: Loop: 399#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 378#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 379#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 388#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 390#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 399#L766-3 [2019-11-15 20:59:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2019-11-15 20:59:36,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:36,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432946586] [2019-11-15 20:59:36,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:36,258 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2019-11-15 20:59:36,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:36,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883615557] [2019-11-15 20:59:36,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,280 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2019-11-15 20:59:36,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:36,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004868334] [2019-11-15 20:59:36,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:36,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:36,352 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:36,485 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 20:59:36,897 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2019-11-15 20:59:37,058 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-15 20:59:37,060 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:59:37,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:59:37,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:59:37,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:59:37,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:59:37,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:59:37,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:59:37,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:59:37,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2019-11-15 20:59:37,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:59:37,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:59:37,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,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-11-15 20:59:37,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-11-15 20:59:37,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,400 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-15 20:59:37,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,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-11-15 20:59:37,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-11-15 20:59:37,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-11-15 20:59:37,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:37,965 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 20:59:38,201 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:59:38,201 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:59:38,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,212 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,225 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,228 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,229 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,232 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,249 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,250 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,250 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,251 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,254 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,261 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-15 20:59:38,262 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:59:38,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,267 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-11-15 20:59:38,267 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:59:38,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,315 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,320 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,327 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,330 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,332 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,332 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,336 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,339 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,344 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,344 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,347 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:38,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:38,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:38,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,354 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,354 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,358 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:38,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:38,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:38,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:38,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:38,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:38,365 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:38,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:38,411 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:59:38,450 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:59:38,450 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:59:38,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:59:38,451 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:59:38,451 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:59:38,452 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2019-11-15 20:59:38,486 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 20:59:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:38,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:59:38,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:38,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:59:38,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:38,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:59:38,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 20:59:38,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2019-11-15 20:59:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:59:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:59:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-15 20:59:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 20:59:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-15 20:59:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:38,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 20:59:38,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:38,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-11-15 20:59:38,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 20:59:38,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2019-11-15 20:59:38,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 20:59:38,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 20:59:38,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-15 20:59:38,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:38,567 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-15 20:59:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-15 20:59:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-15 20:59:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:59:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-15 20:59:38,569 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-15 20:59:38,570 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-15 20:59:38,570 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:59:38,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-15 20:59:38,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:59:38,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:38,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:38,571 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:38,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:38,572 INFO L791 eck$LassoCheckResult]: Stem: 575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 572#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 573#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 570#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 571#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 577#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 560#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 561#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 568#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 569#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 574#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 576#L766-3 assume !(alloc_17_~i~0 < alloc_17_~len); 579#L766-4 alloc_17_#res := 0; 559#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 563#L781-3 [2019-11-15 20:59:38,572 INFO L793 eck$LassoCheckResult]: Loop: 563#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 562#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 563#L781-3 [2019-11-15 20:59:38,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2019-11-15 20:59:38,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451290616] [2019-11-15 20:59:38,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:59:38,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451290616] [2019-11-15 20:59:38,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:38,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:59:38,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672654048] [2019-11-15 20:59:38,604 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2019-11-15 20:59:38,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051390392] [2019-11-15 20:59:38,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,609 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:38,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:59:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:59:38,644 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 20:59:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:38,711 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-11-15 20:59:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:38,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-11-15 20:59:38,712 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-11-15 20:59:38,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2019-11-15 20:59:38,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-15 20:59:38,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-15 20:59:38,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2019-11-15 20:59:38,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:38,714 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-11-15 20:59:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2019-11-15 20:59:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-11-15 20:59:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 20:59:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-15 20:59:38,717 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-15 20:59:38,717 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-15 20:59:38,717 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:59:38,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-11-15 20:59:38,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:59:38,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:38,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:38,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:38,719 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:38,719 INFO L791 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 679#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 680#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 684#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 695#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 688#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 689#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 694#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 675#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 676#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 686#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 687#L766-3 assume !(alloc_17_~i~0 < alloc_17_~len); 692#L766-4 alloc_17_#res := 0; 666#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 670#L781-3 [2019-11-15 20:59:38,719 INFO L793 eck$LassoCheckResult]: Loop: 670#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 669#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 670#L781-3 [2019-11-15 20:59:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2019-11-15 20:59:38,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138181653] [2019-11-15 20:59:38,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:59:38,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138181653] [2019-11-15 20:59:38,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:38,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:59:38,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157656517] [2019-11-15 20:59:38,756 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2019-11-15 20:59:38,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137323107] [2019-11-15 20:59:38,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,763 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:38,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:59:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:59:38,801 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 20:59:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:38,851 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-11-15 20:59:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:38,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2019-11-15 20:59:38,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 20:59:38,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2019-11-15 20:59:38,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 20:59:38,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 20:59:38,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2019-11-15 20:59:38,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:38,854 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-15 20:59:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2019-11-15 20:59:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-15 20:59:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:59:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 20:59:38,856 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 20:59:38,856 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 20:59:38,856 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:59:38,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 20:59:38,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:59:38,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:38,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:38,858 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:38,858 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:38,858 INFO L791 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 779#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 780#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 777#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 778#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 784#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 767#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 768#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 775#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 776#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 781#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 783#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 759#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 760#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 771#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 772#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 764#L773-3 [2019-11-15 20:59:38,858 INFO L793 eck$LassoCheckResult]: Loop: 764#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 763#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 764#L773-3 [2019-11-15 20:59:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2019-11-15 20:59:38,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452941966] [2019-11-15 20:59:38,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,876 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2019-11-15 20:59:38,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145802512] [2019-11-15 20:59:38,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:38,887 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2019-11-15 20:59:38,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:38,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125540347] [2019-11-15 20:59:38,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:59:38,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125540347] [2019-11-15 20:59:38,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:38,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:59:38,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659490993] [2019-11-15 20:59:39,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:59:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:59:39,054 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 20:59:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:39,199 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-11-15 20:59:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:59:39,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2019-11-15 20:59:39,201 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-11-15 20:59:39,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2019-11-15 20:59:39,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-15 20:59:39,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-15 20:59:39,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2019-11-15 20:59:39,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:39,202 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-11-15 20:59:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2019-11-15 20:59:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-11-15 20:59:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:59:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-11-15 20:59:39,206 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-11-15 20:59:39,206 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-11-15 20:59:39,206 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:59:39,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-11-15 20:59:39,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:59:39,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:39,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:39,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:39,207 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:39,207 INFO L791 eck$LassoCheckResult]: Stem: 907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 901#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 902#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 906#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 917#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 918#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 889#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 890#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 903#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 904#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 905#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 913#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 880#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 881#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 893#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 894#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 886#L773-3 assume !(alloc_17_~j~0 >= 0); 887#L773-4 alloc_17_#res := 3; 888#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 892#L781-3 [2019-11-15 20:59:39,207 INFO L793 eck$LassoCheckResult]: Loop: 892#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 891#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 892#L781-3 [2019-11-15 20:59:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 419216258, now seen corresponding path program 1 times [2019-11-15 20:59:39,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:39,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856648616] [2019-11-15 20:59:39,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,232 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2019-11-15 20:59:39,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:39,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795086382] [2019-11-15 20:59:39,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash -860099164, now seen corresponding path program 1 times [2019-11-15 20:59:39,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:39,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506988114] [2019-11-15 20:59:39,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:39,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:39,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:40,013 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 158 [2019-11-15 20:59:40,217 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-11-15 20:59:40,218 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:59:40,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:59:40,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:59:40,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:59:40,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:59:40,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:59:40,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:59:40,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:59:40,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration9_Lasso [2019-11-15 20:59:40,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:59:40,219 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:59:40,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-11-15 20:59:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,562 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-15 20:59:40,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,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-11-15 20:59:40,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:40,878 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-15 20:59:41,136 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 20:59:41,296 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:59:41,296 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:59:41,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:41,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:41,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:41,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:41,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,302 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:41,302 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:41,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:41,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:41,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:41,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,309 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:41,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:41,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:41,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,312 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,316 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,316 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,331 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:41,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:41,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:41,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,336 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,336 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,338 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-15 20:59:41,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,340 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:59:41,340 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:41,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:41,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:41,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:41,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:41,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:41,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:41,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:41,382 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:59:41,413 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:59:41,413 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:59:41,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:59:41,414 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:59:41,414 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:59:41,414 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_free_17_~array.base)_1, ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~array.offset) = 1*v_rep(select #length ULTIMATE.start_free_17_~array.base)_1 - 4*ULTIMATE.start_free_17_~i~1 - 1*ULTIMATE.start_free_17_~array.offset Supporting invariants [] [2019-11-15 20:59:41,444 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 20:59:41,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:59:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:41,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:59:41,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:41,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:59:41,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:41,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:59:41,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-15 20:59:41,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 49 states and 64 transitions. Complement of second has 4 states. [2019-11-15 20:59:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:59:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:59:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2019-11-15 20:59:41,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 20:59:41,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:41,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 20:59:41,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:41,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 20:59:41,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:41,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-11-15 20:59:41,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:59:41,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 27 transitions. [2019-11-15 20:59:41,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:59:41,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:59:41,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-11-15 20:59:41,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:41,538 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 20:59:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-11-15 20:59:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 20:59:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:59:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-15 20:59:41,540 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 20:59:41,540 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 20:59:41,540 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:59:41,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-15 20:59:41,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:59:41,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:41,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:41,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:41,543 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:41,543 INFO L791 eck$LassoCheckResult]: Stem: 1115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1111#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1112#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1109#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1110#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1116#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1101#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1102#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1107#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1108#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1113#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1114#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1097#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1098#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1105#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1106#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1117#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1095#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1096#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1103#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1104#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1100#L773-3 [2019-11-15 20:59:41,543 INFO L793 eck$LassoCheckResult]: Loop: 1100#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1099#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1100#L773-3 [2019-11-15 20:59:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash 718228858, now seen corresponding path program 1 times [2019-11-15 20:59:41,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:41,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213426480] [2019-11-15 20:59:41,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:59:41,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213426480] [2019-11-15 20:59:41,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:59:41,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:59:41,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341512972] [2019-11-15 20:59:41,577 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2019-11-15 20:59:41,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:41,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390171054] [2019-11-15 20:59:41,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:41,587 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:41,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:59:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:59:41,681 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 20:59:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:41,705 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-15 20:59:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:59:41,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2019-11-15 20:59:41,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:59:41,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 31 transitions. [2019-11-15 20:59:41,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 20:59:41,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 20:59:41,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-11-15 20:59:41,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:41,708 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-15 20:59:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-11-15 20:59:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-15 20:59:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:59:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-15 20:59:41,710 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 20:59:41,710 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 20:59:41,710 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:59:41,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-11-15 20:59:41,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:59:41,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:41,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:41,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:41,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:41,712 INFO L791 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1173#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1174#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1171#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1172#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1178#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1163#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1164#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1169#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1170#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1175#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1177#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1159#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1160#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1167#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1168#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1179#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1157#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1158#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1165#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1166#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1162#L773-3 [2019-11-15 20:59:41,712 INFO L793 eck$LassoCheckResult]: Loop: 1162#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1161#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1162#L773-3 [2019-11-15 20:59:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2019-11-15 20:59:41,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:41,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356866569] [2019-11-15 20:59:41,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:41,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356866569] [2019-11-15 20:59:41,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626021993] [2019-11-15 20:59:41,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9efe4a3b-943a-4648-b9d2-8e2962241889/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:59:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:41,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:59:41,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:41,925 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:59:41,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 20:59:41,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913718449] [2019-11-15 20:59:41,926 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:59:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2019-11-15 20:59:41,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:41,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393810227] [2019-11-15 20:59:41,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:41,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:41,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:42,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:59:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:59:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:59:42,037 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-11-15 20:59:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:59:42,134 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-15 20:59:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:59:42,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-11-15 20:59:42,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:59:42,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2019-11-15 20:59:42,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:59:42,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:59:42,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-11-15 20:59:42,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:59:42,137 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-15 20:59:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-11-15 20:59:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-15 20:59:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 20:59:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-15 20:59:42,139 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 20:59:42,139 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 20:59:42,139 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:59:42,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2019-11-15 20:59:42,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:59:42,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:59:42,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:59:42,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:59:42,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:59:42,141 INFO L791 eck$LassoCheckResult]: Stem: 1311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1308#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1309#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1306#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1307#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1314#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1298#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1299#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1304#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1305#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1310#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1316#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1312#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1313#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1294#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1295#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1302#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1303#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1315#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1292#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1293#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1300#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1301#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1297#L773-3 [2019-11-15 20:59:42,141 INFO L793 eck$LassoCheckResult]: Loop: 1297#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1296#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1297#L773-3 [2019-11-15 20:59:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2019-11-15 20:59:42,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:42,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239147231] [2019-11-15 20:59:42,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 4 times [2019-11-15 20:59:42,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:42,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904757185] [2019-11-15 20:59:42,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2019-11-15 20:59:42,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:59:42,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697317849] [2019-11-15 20:59:42,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:59:42,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:59:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:59:42,260 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:59:44,005 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 251 DAG size of output: 214 [2019-11-15 20:59:44,047 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:59:44,323 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-11-15 20:59:44,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:59:44,330 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:59:44,567 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-11-15 20:59:44,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:59:44,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 20:59:44,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:335, output treesize:327 [2019-11-15 20:59:44,825 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-11-15 20:59:44,827 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:59:44,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:59:44,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:59:44,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:59:44,828 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:59:44,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:59:44,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:59:44,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:59:44,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration12_Lasso [2019-11-15 20:59:44,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:59:44,828 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:59:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:44,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:45,243 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-15 20:59:45,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:45,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:59:45,901 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-15 20:59:46,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:59:46,007 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:59:46,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,010 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,010 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,013 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,015 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,027 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,027 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,035 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,040 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,040 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,043 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,071 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,074 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,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-11-15 20:59:46,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,083 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-15 20:59:46,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,085 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-15 20:59:46,085 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,105 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:59:46,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:59:46,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:59:46,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:59:46,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:59:46,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:59:46,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:59:46,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:59:46,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:59:46,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:59:46,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:59:46,132 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:59:46,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:59:46,139 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:59:46,139 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:59:46,140 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 20:59:46,140 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:59:46,141 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0, ULTIMATE.start_ldv_positive_#res) = 4*ULTIMATE.start_alloc_17_~j~0 + 1*ULTIMATE.start_ldv_positive_#res Supporting invariants [1*ULTIMATE.start_ldv_positive_#res - 2 >= 0] [2019-11-15 20:59:46,185 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2019-11-15 20:59:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:59:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:46,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:59:46,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:59:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:59:46,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:59:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:59:46,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-15 20:59:46,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-15 20:59:46,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 31 transitions. Complement of second has 8 states. [2019-11-15 20:59:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:59:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:59:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-11-15 20:59:46,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-15 20:59:46,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:46,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 2 letters. [2019-11-15 20:59:46,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:46,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 23 letters. Loop has 4 letters. [2019-11-15 20:59:46,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:59:46,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-15 20:59:46,399 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:59:46,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-11-15 20:59:46,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:59:46,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:59:46,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:59:46,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:59:46,400 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:59:46,400 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:59:46,400 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:59:46,400 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 20:59:46,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:59:46,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:59:46,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:59:46,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:59:46 BoogieIcfgContainer [2019-11-15 20:59:46,404 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:59:46,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:59:46,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:59:46,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:59:46,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:59:32" (3/4) ... [2019-11-15 20:59:46,408 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:59:46,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:59:46,409 INFO L168 Benchmark]: Toolchain (without parser) took 15068.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 934.4 MB in the beginning and 1.0 GB in the end (delta: -69.6 MB). Peak memory consumption was 225.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:59:46,410 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:59:46,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:59:46,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:59:46,411 INFO L168 Benchmark]: Boogie Preprocessor took 39.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:59:46,411 INFO L168 Benchmark]: RCFGBuilder took 377.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:59:46,412 INFO L168 Benchmark]: BuchiAutomizer took 13873.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.6 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:59:46,412 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:59:46,415 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 716.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 377.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13873.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.6 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i + -1 * array and consists of 3 locations. One deterministic module has affine ranking function 4 * j + \result and consists of 7 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.8s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 12.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 354 SDtfs, 514 SDslu, 551 SDs, 0 SdLazy, 286 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital316 mio100 ax110 hnf100 lsp84 ukn59 mio100 lsp53 div100 bol100 ite100 ukn100 eq190 hnf89 smp96 dnf168 smp79 tf100 neg98 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...