./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/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 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:54:53,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:54:53,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:54:53,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:54:53,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:54:53,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:54:53,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:54:53,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:54:53,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:54:53,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:54:53,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:54:53,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:54:53,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:54:53,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:54:53,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:54:53,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:54:53,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:54:53,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:54:53,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:54:53,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:54:53,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:54:53,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:54:53,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:54:53,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:54:53,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:54:53,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:54:53,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:54:53,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:54:53,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:54:53,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:54:53,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:54:53,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:54:53,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:54:53,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:54:53,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:54:53,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:54:53,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:54:53,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:54:53,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:54:53,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:54:53,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:54:53,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:54:53,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:54:53,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:54:53,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:54:53,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:54:53,719 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:54:53,719 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:54:53,720 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:54:53,720 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:54:53,720 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:54:53,720 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:54:53,721 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:54:53,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:54:53,721 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:54:53,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:54:53,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:54:53,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:54:53,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:54:53,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:54:53,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:54:53,723 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:54:53,723 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:54:53,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:54:53,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:54:53,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:54:53,724 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:54:53,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:54:53,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:54:53,724 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:54:53,725 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:54:53,725 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/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 -> 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca [2019-11-15 21:54:53,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:54:53,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:54:53,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:54:53,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:54:53,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:54:53,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2019-11-15 21:54:53,820 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/data/4804cad01/654ce7f15049434291ffe9b72b46745d/FLAG69e09327f [2019-11-15 21:54:54,268 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:54:54,268 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2019-11-15 21:54:54,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/data/4804cad01/654ce7f15049434291ffe9b72b46745d/FLAG69e09327f [2019-11-15 21:54:54,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/data/4804cad01/654ce7f15049434291ffe9b72b46745d [2019-11-15 21:54:54,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:54:54,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:54:54,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:54,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:54:54,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:54:54,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:54" (1/1) ... [2019-11-15 21:54:54,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1101df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:54, skipping insertion in model container [2019-11-15 21:54:54,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:54" (1/1) ... [2019-11-15 21:54:54,806 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:54:54,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:54:55,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:55,275 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:54:55,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:55,399 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:54:55,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55 WrapperNode [2019-11-15 21:54:55,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:55,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:54:55,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:54:55,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:54:55,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:54:55,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:54:55,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:54:55,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:54:55,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... [2019-11-15 21:54:55,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:54:55,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:54:55,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:54:55,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:54:55,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_352de6d4-dfc9-46a8-9cb1-3313c172f24a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:54:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:54:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:54:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:54:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:54:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:54:55,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:54:55,941 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:54:55,941 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:54:55,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:55 BoogieIcfgContainer [2019-11-15 21:54:55,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:54:55,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:54:55,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:54:55,947 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:54:55,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:54:55,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:54:54" (1/3) ... [2019-11-15 21:54:55,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b91697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:54:55, skipping insertion in model container [2019-11-15 21:54:55,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:54:55,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:55" (2/3) ... [2019-11-15 21:54:55,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b91697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:54:55, skipping insertion in model container [2019-11-15 21:54:55,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:54:55,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:55" (3/3) ... [2019-11-15 21:54:55,952 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca.i [2019-11-15 21:54:56,000 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:54:56,000 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:54:56,001 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:54:56,001 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:54:56,002 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:54:56,002 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:54:56,002 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:54:56,002 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:54:56,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:54:56,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:54:56,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:54:56,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:54:56,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:54:56,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:54:56,052 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:54:56,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:54:56,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:54:56,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:54:56,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:54:56,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:54:56,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:54:56,063 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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-11-15 21:54:56,063 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 !!(49 != 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-11-15 21:54:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:54:56,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:56,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223293116] [2019-11-15 21:54:56,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,232 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 21:54:56,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:56,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376630621] [2019-11-15 21:54:56,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:56,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376630621] [2019-11-15 21:54:56,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:56,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:54:56,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268350301] [2019-11-15 21:54:56,272 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:54:56,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:54:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:54:56,288 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 21:54:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:56,295 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 21:54:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:54:56,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 21:54:56,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:54:56,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 21:54:56,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:54:56,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:54:56,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 21:54:56,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:54:56,305 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:54:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 21:54:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:54:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:54:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 21:54:56,332 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:54:56,332 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:54:56,332 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:54:56,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 21:54:56,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:54:56,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:54:56,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:54:56,334 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:54:56,334 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:56,334 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_~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.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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-11-15 21:54:56,335 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 !!(49 != 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 := 49 != 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~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 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-11-15 21:54:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 21:54:56,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:56,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333927137] [2019-11-15 21:54:56,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 21:54:56,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:56,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347117426] [2019-11-15 21:54:56,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:56,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:56,409 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 21:54:56,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:56,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735096431] [2019-11-15 21:54:56,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:56,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:56,514 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:56,758 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 21:54:57,045 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 21:54:57,419 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-11-15 21:54:57,561 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 21:54:57,574 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:54:57,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:54:57,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:54:57,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:54:57,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:54:57,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:54:57,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:54:57,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:54:57,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration2_Lasso [2019-11-15 21:54:57,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:54:57,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:54:57,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,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-11-15 21:54:57,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-11-15 21:54:57,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:57,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:54:58,093 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-15 21:54:58,336 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-15 21:54:59,162 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 21:54:59,367 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-11-15 21:54:59,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:54:59,388 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:54:59,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,406 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:54:59,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:54:59,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,429 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,442 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:54:59,442 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:54:59,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,466 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,487 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,487 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,504 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:54:59,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:54:59,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:54:59,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:54:59,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:54:59,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:54:59,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:54:59,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:54:59,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:54:59,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:54:59,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:54:59,588 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:54:59,614 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:54:59,614 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:54:59,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:54:59,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:54:59,618 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:54:59,618 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-11-15 21:54:59,656 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 21:54:59,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:54:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:59,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:59,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:59,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:54:59,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:59,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:54:59,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:54:59,794 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-11-15 21:54:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:54:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:54:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 21:54:59,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:54:59,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:54:59,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 21:54:59,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:54:59,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 21:54:59,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:54:59,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 21:54:59,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:54:59,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 21:54:59,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:54:59,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:54:59,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 21:54:59,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:54:59,801 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:54:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 21:54:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 21:54:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:54:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 21:54:59,803 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:54:59,804 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:54:59,804 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:54:59,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 21:54:59,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:54:59,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:54:59,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:54:59,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:59,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:54:59,805 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_~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.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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 !!(49 != 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-11-15 21:54:59,806 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 := 49 != 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~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;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-11-15 21:54:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 21:54:59,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:59,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060766432] [2019-11-15 21:54:59,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 21:54:59,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:59,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492969842] [2019-11-15 21:54:59,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:54:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 21:54:59,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:59,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459665098] [2019-11-15 21:54:59,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:59,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:54:59,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:55:00,129 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 21:55:00,506 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-11-15 21:55:00,616 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-15 21:55:00,617 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:55:00,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:55:00,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:55:00,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:55:00,618 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:55:00,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:55:00,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:55:00,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:55:00,618 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration3_Lasso [2019-11-15 21:55:00,618 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:55:00,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:55:00,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:00,941 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-15 21:55:01,058 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-15 21:55:01,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:01,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-11-15 21:55:01,700 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:55:01,972 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 21:55:02,001 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:55:02,001 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:55:02,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:02,013 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:02,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,043 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,044 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:02,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:02,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:02,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,048 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:55:02,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,055 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:55:02,055 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:02,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:02,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:02,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:02,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:02,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:02,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:02,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:02,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:02,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:02,146 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:55:02,202 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:55:02,203 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:55:02,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:55:02,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:55:02,205 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:55:02,205 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-11-15 21:55:02,266 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 21:55:02,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:55:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:02,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:55:02,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:02,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:55:02,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:02,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:55:02,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:55:02,374 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-11-15 21:55:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:55:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:55:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:55:02,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:55:02,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:02,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 21:55:02,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:02,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 21:55:02,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:02,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 21:55:02,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:55:02,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 21:55:02,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:55:02,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:55:02,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 21:55:02,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:55:02,387 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 21:55:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 21:55:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 21:55:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:55:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 21:55:02,393 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:55:02,394 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:55:02,394 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:55:02,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 21:55:02,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:55:02,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:55:02,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:55:02,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:02,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:55:02,398 INFO L791 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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; 349#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 350#L369-1 assume !!(49 != 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; 363#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 359#L372-1 assume !cstrspn_#t~short210; 360#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 345#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 346#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 347#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; 348#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 352#L369-1 assume !!(49 != 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; 362#L372-5 [2019-11-15 21:55:02,398 INFO L793 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 357#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); 358#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;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; 362#L372-5 [2019-11-15 21:55:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 21:55:02,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:02,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551127768] [2019-11-15 21:55:02,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:02,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551127768] [2019-11-15 21:55:02,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:55:02,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:55:02,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967146257] [2019-11-15 21:55:02,515 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:55:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 21:55:02,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:02,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246040306] [2019-11-15 21:55:02,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:55:02,652 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-11-15 21:55:02,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:55:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:02,745 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 21:55:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:02,826 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-15 21:55:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:55:02,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 21:55:02,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:55:02,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-15 21:55:02,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:55:02,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:55:02,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 21:55:02,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:55:02,829 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 21:55:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 21:55:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-15 21:55:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 21:55:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 21:55:02,831 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 21:55:02,831 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 21:55:02,831 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:55:02,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-15 21:55:02,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:55:02,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:55:02,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:55:02,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:02,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:55:02,833 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 427#L382 assume !(main_~length1~0 < 1); 428#L382-2 assume !(main_~length2~0 < 1); 425#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, 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; 421#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 422#L369-1 assume !!(49 != 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; 440#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 439#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); 438#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 417#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 418#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 419#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; 420#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 423#L369-1 assume !!(49 != 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; 434#L372-5 [2019-11-15 21:55:02,833 INFO L793 eck$LassoCheckResult]: Loop: 434#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 429#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); 430#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;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; 434#L372-5 [2019-11-15 21:55:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 21:55:02,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:02,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94693601] [2019-11-15 21:55:02,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:55:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 21:55:02,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:02,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192879298] [2019-11-15 21:55:02,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,872 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:55:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 21:55:02,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:02,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801257370] [2019-11-15 21:55:02,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:02,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:55:02,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:55:03,667 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 139 [2019-11-15 21:55:04,616 WARN L191 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-11-15 21:55:04,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:55:04,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:55:04,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:55:04,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:55:04,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:55:04,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:55:04,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:55:04,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:55:04,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration5_Lasso [2019-11-15 21:55:04,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:55:04,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:55:04,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,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-11-15 21:55:04,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:04,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 21:55:05,598 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-11-15 21:55:05,750 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 21:55:05,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:55:06,019 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 21:55:06,477 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-15 21:55:06,668 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 21:55:07,108 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:55:07,135 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:55:07,136 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:55:07,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,141 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,142 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,158 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,164 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,171 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:55:07,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:55:07,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:55:07,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,176 INFO L202 nArgumentSynthesizer]: 6 stem disjuncts [2019-11-15 21:55:07,176 INFO L203 nArgumentSynthesizer]: 7 loop disjuncts [2019-11-15 21:55:07,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,217 INFO L400 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2019-11-15 21:55:07,217 INFO L401 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2019-11-15 21:55:07,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,646 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:55:07,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:55:07,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-11-15 21:55:07,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:55:07,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:55:07,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:55:07,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:55:07,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:55:07,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:55:07,712 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:55:07,755 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:55:07,755 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:55:07,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:55:07,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:55:07,756 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:55:07,757 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-15 21:55:07,897 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-11-15 21:55:07,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:55:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:07,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:55:07,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:07,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:55:07,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:07,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:55:07,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:55:07,991 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-11-15 21:55:07,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:55:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:55:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:55:07,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:55:07,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:07,994 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:55:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:08,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:55:08,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:08,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:55:08,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:08,059 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-11-15 21:55:08,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:55:08,079 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-11-15 21:55:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:55:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:55:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:55:08,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:55:08,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:08,084 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:55:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:08,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:55:08,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:08,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:55:08,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:08,148 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-11-15 21:55:08,148 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:55:08,174 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-11-15 21:55:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:55:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:55:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 21:55:08,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:55:08,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:08,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:55:08,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:08,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 21:55:08,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:55:08,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 21:55:08,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:55:08,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:55:08,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:55:08,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:55:08,179 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:55:08,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:55:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:55:08,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:55:08,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:55:08 BoogieIcfgContainer [2019-11-15 21:55:08,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:55:08,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:55:08,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:55:08,193 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:55:08,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:55" (3/4) ... [2019-11-15 21:55:08,197 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:55:08,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:55:08,199 INFO L168 Benchmark]: Toolchain (without parser) took 13408.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:55:08,200 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:55:08,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:55:08,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:55:08,207 INFO L168 Benchmark]: Boogie Preprocessor took 47.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:55:08,207 INFO L168 Benchmark]: RCFGBuilder took 418.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:55:08,208 INFO L168 Benchmark]: BuchiAutomizer took 12250.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.5 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:55:08,208 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:55:08,215 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12250.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.5 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 unknown-#length-unknown[s] + -1 * 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 12.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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, 120 SDslu, 52 SDs, 0 SdLazy, 95 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp31 div127 bol100 ite100 ukn100 eq168 hnf81 smp93 dnf653 smp46 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 468ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...