./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_malloc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c357a0f089ccce134e4135f49c3923f49db9d7a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:50,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:50,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:50,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:50,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:50,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:50,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:50,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:50,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:50,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:50,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:50,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:50,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:50,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:50,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:50,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:50,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:50,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:50,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:50,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:50,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:50,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:50,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:50,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:50,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:50,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:50,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:50,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:50,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:50,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:50,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:50,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:50,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:50,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:50,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:50,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:50,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:50,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:50,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:50,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:50,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:50,669 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:50,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:50,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:50,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:50,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:50,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:50,694 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:50,694 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:50,694 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:50,695 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:50,695 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:50,695 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:50,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:50,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:50,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:50,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:50,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:50,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:50,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:50,697 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:50,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:50,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:50,697 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:50,698 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:50,698 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2019-10-22 08:56:50,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:50,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:50,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:50,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:50,749 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:50,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_malloc.i [2019-10-22 08:56:50,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/data/e6d4e2110/ae6c3aa68e714f43b4aed4079c73bd88/FLAG64fe4f5ce [2019-10-22 08:56:51,290 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:51,293 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/sv-benchmarks/c/termination-15/cstrspn_malloc.i [2019-10-22 08:56:51,303 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/data/e6d4e2110/ae6c3aa68e714f43b4aed4079c73bd88/FLAG64fe4f5ce [2019-10-22 08:56:51,598 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/data/e6d4e2110/ae6c3aa68e714f43b4aed4079c73bd88 [2019-10-22 08:56:51,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:51,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:51,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:51,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:51,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:51,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:51" (1/1) ... [2019-10-22 08:56:51,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d1e4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:51, skipping insertion in model container [2019-10-22 08:56:51,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:51" (1/1) ... [2019-10-22 08:56:51,616 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:51,652 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:52,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,026 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:52,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,124 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:52,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52 WrapperNode [2019-10-22 08:56:52,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:52,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:52,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:52,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:52,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:52,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:52,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:52,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:52,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11ff7994-fa97-4572-a1ea-7168ee7b7ac6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:56:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:52,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:52,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:52,539 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:56:52,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52 BoogieIcfgContainer [2019-10-22 08:56:52,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:52,541 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:52,541 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:52,544 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:52,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:51" (1/3) ... [2019-10-22 08:56:52,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b1af7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (2/3) ... [2019-10-22 08:56:52,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b1af7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/3) ... [2019-10-22 08:56:52,551 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc.i [2019-10-22 08:56:52,610 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:52,611 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:52,611 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:52,611 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:52,611 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:52,611 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:52,611 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:52,612 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:52,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:56:52,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:56:52,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:52,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:52,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:52,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,660 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:52,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:56:52,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:56:52,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:52,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:52,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:52,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,670 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-10-22 08:56:52,671 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-10-22 08:56:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:56:52,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057141259] [2019-10-22 08:56:52,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,835 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 08:56:52,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395045154] [2019-10-22 08:56:52,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395045154] [2019-10-22 08:56:52,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:52,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:52,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768283697] [2019-10-22 08:56:52,872 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:52,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:52,883 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:56:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:52,889 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:56:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:52,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:56:52,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:56:52,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 08:56:52,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:56:52,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:52,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:56:52,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:52,898 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:56:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:56:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:56:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:56:52,923 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:52,923 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:56:52,924 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:52,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:56:52,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:56:52,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:52,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:52,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:52,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,927 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-10-22 08:56:52,927 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-10-22 08:56:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:56:52,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135239488] [2019-10-22 08:56:52,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 08:56:52,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425632955] [2019-10-22 08:56:52,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,033 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 08:56:53,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339619554] [2019-10-22 08:56:53,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,132 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,346 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-22 08:56:53,575 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 08:56:53,850 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-10-22 08:56:53,966 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:56:53,978 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:53,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:53,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:53,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:53,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:53,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:53,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:53,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:53,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration2_Lasso [2019-10-22 08:56:53,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:53,981 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:54,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,368 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-22 08:56:54,518 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:56:54,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-10-22 08:56:54,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,113 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:56:55,289 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:55,294 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:55,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-10-22 08:56:55,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,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-10-22 08:56:55,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,305 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,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-10-22 08:56:55,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,309 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,309 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,317 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,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-10-22 08:56:55,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,321 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,321 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,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-10-22 08:56:55,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,340 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,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-10-22 08:56:55,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,355 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:55,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,362 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:55,362 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,412 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,456 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,465 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,483 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,483 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,510 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:55,533 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:55,533 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:55,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:55,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:55,537 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:55,537 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2019-10-22 08:56:55,564 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:56:55,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:55,673 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-10-22 08:56:55,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:56:55,752 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 08:56:55,753 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-10-22 08:56:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:56:55,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:56:55,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 08:56:55,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 08:56:55,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:56:55,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:55,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 08:56:55,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:55,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:55,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:56:55,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:55,760 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:56:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:56:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:56:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:56:55,763 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:56:55,763 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:56:55,763 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:55,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:56:55,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:55,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:55,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:55,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:55,765 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:55,765 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-10-22 08:56:55,765 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-10-22 08:56:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 08:56:55,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019260758] [2019-10-22 08:56:55,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 08:56:55,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416253953] [2019-10-22 08:56:55,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 08:56:55,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694714019] [2019-10-22 08:56:55,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,326 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-10-22 08:56:56,426 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:56,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:56,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:56,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:56,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:56,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:56,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:56,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:56,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration3_Lasso [2019-10-22 08:56:56,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:56,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:56,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,724 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-10-22 08:56:56,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,493 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:56:57,631 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:56:57,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:57,650 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:57,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,662 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,666 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,692 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,721 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:57,747 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:57,747 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:57,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:57,749 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:57,749 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:57,749 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-10-22 08:56:57,806 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 08:56:57,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,853 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-10-22 08:56:57,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:56:57,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 08:56:57,881 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-10-22 08:56:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:56:57,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:56:57,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:56:57,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:56:57,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 08:56:57,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:57,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 08:56:57,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:57,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:57,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:56:57,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:57,886 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:56:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:56:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:56:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:56:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:56:57,888 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:56:57,888 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:56:57,888 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:57,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:56:57,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:57,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:57,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:57,890 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:57,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:57,890 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 357#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 371#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 367#L372-1 assume !cstrspn_#t~short210; 368#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 353#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 354#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 355#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 356#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 370#L372-5 [2019-10-22 08:56:57,890 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 365#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 366#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 370#L372-5 [2019-10-22 08:56:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 08:56:57,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:57,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643250544] [2019-10-22 08:56:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643250544] [2019-10-22 08:56:57,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:57,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:56:57,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994972419] [2019-10-22 08:56:57,940 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 08:56:57,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:57,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501266382] [2019-10-22 08:56:57,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:58,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:58,093 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:56:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:58,153 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 08:56:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:58,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:56:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:58,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-10-22 08:56:58,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:58,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:58,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-10-22 08:56:58,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:58,155 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:56:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-10-22 08:56:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 08:56:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:56:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 08:56:58,157 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:56:58,157 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:56:58,157 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:58,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 08:56:58,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:58,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:58,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:58,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:58,158 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:58,159 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 429#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 430#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 443#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 447#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 446#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210; 425#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 426#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 427#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 428#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 432#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 442#L372-5 [2019-10-22 08:56:58,159 INFO L793 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 438#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 439#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 442#L372-5 [2019-10-22 08:56:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 08:56:58,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:58,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531537517] [2019-10-22 08:56:58,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,181 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 08:56:58,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:58,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101877419] [2019-10-22 08:56:58,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 08:56:58,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:58,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731473688] [2019-10-22 08:56:58,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,227 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:58,801 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 140 [2019-10-22 08:56:59,635 WARN L191 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-10-22 08:56:59,636 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:59,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:59,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:59,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:59,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:59,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:59,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:59,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:59,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration5_Lasso [2019-10-22 08:56:59,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:59,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:59,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:59,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:57:00,429 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-10-22 08:57:00,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:00,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:01,055 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-22 08:57:01,208 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:57:01,536 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:57:01,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:01,564 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:01,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:01,571 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:01,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,575 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:01,586 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:01,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,592 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,592 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,595 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,595 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,596 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,598 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:01,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:01,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:01,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,599 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:01,599 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:57:01,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,623 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-10-22 08:57:01,623 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:57:01,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,828 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:01,828 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:01,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:01,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:01,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:01,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:01,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:01,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:01,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:01,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:01,838 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:01,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:01,864 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:01,885 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:01,885 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:57:01,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:01,886 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:01,886 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:01,887 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 Supporting invariants [] [2019-10-22 08:57:02,014 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2019-10-22 08:57:02,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:02,067 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-10-22 08:57:02,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:02,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:57:02,094 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-10-22 08:57:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:02,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:02,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:02,095 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:02,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:02,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:02,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:57:02,169 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-10-22 08:57:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:02,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:02,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:02,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:02,227 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:02,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:02,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-10-22 08:57:02,253 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-10-22 08:57:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 08:57:02,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:02,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:02,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:57:02,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:02,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:57:02,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:02,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 08:57:02,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:02,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 08:57:02,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:02,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:02,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:02,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:02,261 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:02,261 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:02,261 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:02,261 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:02,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:02,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:02,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:02,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:02 BoogieIcfgContainer [2019-10-22 08:57:02,271 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:02,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:02,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:02,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:02,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/4) ... [2019-10-22 08:57:02,275 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:02,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:02,279 INFO L168 Benchmark]: Toolchain (without parser) took 10677.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 943.1 MB in the beginning and 1.0 GB in the end (delta: -85.9 MB). Peak memory consumption was 281.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,279 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:02,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,281 INFO L168 Benchmark]: Boogie Preprocessor took 30.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,282 INFO L168 Benchmark]: RCFGBuilder took 341.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,283 INFO L168 Benchmark]: BuchiAutomizer took 9730.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.7 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:02,283 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:02,285 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 341.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9730.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.7 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.14 ms. Allocated memory is still 1.4 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 104 SDslu, 52 SDs, 0 SdLazy, 97 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div126 bol100 ite100 ukn100 eq172 hnf81 smp96 dnf599 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 227ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...