./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/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 61869dea11c33643d44719730b54f6ea8fd7faa2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:05:04,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:05:04,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:05:04,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:05:04,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:05:04,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:05:04,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:05:04,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:05:04,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:05:04,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:05:04,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:05:04,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:05:04,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:05:04,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:05:04,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:05:04,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:05:04,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:05:04,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:05:04,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:05:04,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:05:04,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:05:04,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:05:04,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:05:04,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:05:04,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:05:04,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:05:04,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:05:04,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:05:04,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:05:04,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:05:04,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:05:04,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:05:04,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:05:04,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:05:04,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:05:04,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:05:04,409 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:05:04,419 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:05:04,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:05:04,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:05:04,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:05:04,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:05:04,421 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:05:04,421 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:05:04,421 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:05:04,421 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:05:04,421 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:05:04,421 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:05:04,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:05:04,422 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:05:04,423 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:05:04,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:05:04,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:05:04,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:05:04,423 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:05:04,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:05:04,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:05:04,424 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:05:04,424 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:05:04,424 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/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 -> 61869dea11c33643d44719730b54f6ea8fd7faa2 [2018-11-23 06:05:04,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:05:04,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:05:04,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:05:04,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:05:04,462 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:05:04,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:05:04,507 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/data/3b0c9efd2/92c34ed92bbd49a48d140de2bbb23fb1/FLAG8eee8cbda [2018-11-23 06:05:04,929 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:05:04,929 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:05:04,936 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/data/3b0c9efd2/92c34ed92bbd49a48d140de2bbb23fb1/FLAG8eee8cbda [2018-11-23 06:05:04,944 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/uautomizer/data/3b0c9efd2/92c34ed92bbd49a48d140de2bbb23fb1 [2018-11-23 06:05:04,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:05:04,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:05:04,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:05:04,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:05:04,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:05:04,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:05:04" (1/1) ... [2018-11-23 06:05:04,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63561eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:04, skipping insertion in model container [2018-11-23 06:05:04,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:05:04" (1/1) ... [2018-11-23 06:05:04,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:05:04,987 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:05:05,175 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:05:05,183 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:05:05,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:05:05,282 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:05:05,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05 WrapperNode [2018-11-23 06:05:05,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:05:05,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:05:05,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:05:05,283 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:05:05,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:05:05,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:05:05,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:05:05,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:05:05,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... [2018-11-23 06:05:05,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:05:05,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:05:05,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:05:05,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:05:05,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af13cbc2-6c6c-45ad-a783-ad36b141160b/bin-2019/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 [2018-11-23 06:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:05:05,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:05:05,579 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:05:05,579 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:05:05,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:05:05 BoogieIcfgContainer [2018-11-23 06:05:05,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:05:05,580 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:05:05,580 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:05:05,583 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:05:05,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:05,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:05:04" (1/3) ... [2018-11-23 06:05:05,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be3e29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:05:05, skipping insertion in model container [2018-11-23 06:05:05,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:05,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:05:05" (2/3) ... [2018-11-23 06:05:05,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be3e29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:05:05, skipping insertion in model container [2018-11-23 06:05:05,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:05:05,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:05:05" (3/3) ... [2018-11-23 06:05:05,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:05:05,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:05:05,624 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:05:05,624 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:05:05,624 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:05:05,625 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:05:05,625 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:05:05,625 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:05:05,625 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:05:05,625 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:05:05,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:05:05,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:05:05,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:05,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:05,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:05:05,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:05:05,656 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:05:05,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 06:05:05,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:05:05,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:05,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:05,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:05:05,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:05:05,663 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 8#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 3#L552-4true [2018-11-23 06:05:05,663 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 5#L557true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 20#L552-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 3#L552-4true [2018-11-23 06:05:05,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 06:05:05,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 06:05:05,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:05,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:05:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:05:05,804 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:05:05,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:05:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:05:05,815 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 06:05:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:05:05,820 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 06:05:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:05:05,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 06:05:05,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:05:05,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 06:05:05,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 06:05:05,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:05:05,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 06:05:05,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:05:05,826 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:05:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 06:05:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 06:05:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 06:05:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 06:05:05,848 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:05:05,848 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 06:05:05,848 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:05:05,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 06:05:05,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:05:05,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:05,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:05,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:05:05,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:05,850 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 44#L552-4 [2018-11-23 06:05:05,850 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 51#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 52#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 55#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 46#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 47#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 44#L552-4 [2018-11-23 06:05:05,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:05,850 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 06:05:05,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 06:05:05,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 06:05:05,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:05,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:06,120 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 06:05:06,276 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 06:05:06,472 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 06:05:06,539 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:06,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:06,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:06,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:06,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:06,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:06,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:06,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:06,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 06:05:06,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:06,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:06,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:06,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:07,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:07,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:07,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:07,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:07,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,330 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:05:07,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:05:07,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:07,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:07,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:07,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,370 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:07,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:07,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:07,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:07,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:07,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:07,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:07,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:07,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:07,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:07,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:07,431 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:05:07,431 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:05:07,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:07,433 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:05:07,434 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:07,434 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-11-23 06:05:07,478 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 06:05:07,484 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:05:07,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:07,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:07,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:07,570 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 [2018-11-23 06:05:07,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 06:05:07,621 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. [2018-11-23 06:05:07,622 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 [2018-11-23 06:05:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 06:05:07,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 06:05:07,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:07,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 06:05:07,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:07,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 06:05:07,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:07,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 06:05:07,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:05:07,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 06:05:07,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 06:05:07,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 06:05:07,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 06:05:07,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:07,627 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:05:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 06:05:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 06:05:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:05:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 06:05:07,629 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:05:07,629 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 06:05:07,629 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:05:07,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 06:05:07,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:05:07,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:07,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:07,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:07,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:05:07,631 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 178#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 193#L555-5 [2018-11-23 06:05:07,631 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 187#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 188#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 193#L555-5 [2018-11-23 06:05:07,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 06:05:07,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 06:05:07,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:07,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 06:05:07,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:07,984 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-23 06:05:08,047 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:08,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:08,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:08,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:08,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:08,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:08,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:08,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:08,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:05:08,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:08,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:08,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,231 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-23 06:05:08,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:08,641 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 06:05:08,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:08,691 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:08,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:08,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:08,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:08,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:08,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:08,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:08,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:08,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:08,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:08,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:08,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:08,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:08,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:08,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:08,763 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:05:08,764 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:05:08,764 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:08,765 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:05:08,765 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:08,765 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-23 06:05:08,824 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 06:05:08,826 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:05:08,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:08,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:08,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:08,902 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:05:08,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 06:05:08,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 06:05:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:05:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:05:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 06:05:08,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 06:05:08,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:08,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 06:05:08,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:08,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 06:05:08,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:08,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 06:05:08,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:05:08,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 06:05:08,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:05:08,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:05:08,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 06:05:08,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:08,954 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 06:05:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 06:05:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 06:05:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 06:05:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 06:05:08,960 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 06:05:08,960 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 06:05:08,960 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:05:08,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 06:05:08,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:05:08,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:08,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:08,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:08,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:05:08,962 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L565 assume !(main_~length1~0 < 1); 359#L565-2 assume !(main_~length2~0 < 1); 357#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 350#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 351#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 367#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 372#L555-1 assume !cstrpbrk_#t~short7; 371#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 370#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 355#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 356#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 352#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 354#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 366#L555-5 [2018-11-23 06:05:08,962 INFO L796 eck$LassoCheckResult]: Loop: 366#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 360#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 361#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 366#L555-5 [2018-11-23 06:05:08,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 06:05:08,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:08,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:08,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:09,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:05:09,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:05:09,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:05:09,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 06:05:09,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:09,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:05:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,221 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 06:05:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:05:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:05:09,222 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 06:05:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:05:09,273 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 06:05:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:05:09,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 06:05:09,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:05:09,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 06:05:09,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:05:09,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:05:09,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 06:05:09,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:05:09,275 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 06:05:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 06:05:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 06:05:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 06:05:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 06:05:09,276 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 06:05:09,277 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 06:05:09,277 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:05:09,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 06:05:09,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:05:09,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:05:09,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:05:09,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:05:09,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:05:09,278 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 430#L565 assume !(main_~length1~0 < 1); 431#L565-2 assume !(main_~length2~0 < 1); 429#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 422#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 423#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 439#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 440#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 442#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 441#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 427#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 428#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 424#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 426#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 438#L555-5 [2018-11-23 06:05:09,278 INFO L796 eck$LassoCheckResult]: Loop: 438#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 432#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 433#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 438#L555-5 [2018-11-23 06:05:09,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 06:05:09,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 06:05:09,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 06:05:09,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:05:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:05:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:05:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:05:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:05:09,771 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2018-11-23 06:05:10,340 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-23 06:05:10,342 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:05:10,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:05:10,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:05:10,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:05:10,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:05:10,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:05:10,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:05:10,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:05:10,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 06:05:10,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:05:10,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:05:10,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:10,567 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 06:05:10,997 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2018-11-23 06:05:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:05:11,472 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 06:05:11,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:05:11,682 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:05:11,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:05:11,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:05:11,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:05:11,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,734 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 06:05:11,734 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 06:05:11,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,756 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 06:05:11,756 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 06:05:11,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,865 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:11,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,866 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:11,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,871 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:05:11,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,872 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:05:11,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:05:11,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:05:11,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:05:11,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:05:11,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:05:11,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:05:11,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:05:11,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:05:11,894 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:05:11,913 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 06:05:11,914 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:05:11,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:05:11,915 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:05:11,916 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:05:11,916 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-23 06:05:12,063 INFO L297 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2018-11-23 06:05:12,065 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:05:12,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:12,128 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 [2018-11-23 06:05:12,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 06:05:12,157 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. [2018-11-23 06:05:12,157 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 [2018-11-23 06:05:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 06:05:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:05:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:12,158 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:05:12,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:12,199 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 [2018-11-23 06:05:12,199 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 06:05:12,218 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. [2018-11-23 06:05:12,218 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 [2018-11-23 06:05:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 06:05:12,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:05:12,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:12,218 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:05:12,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:05:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:05:12,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:05:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:05:12,287 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 [2018-11-23 06:05:12,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 06:05:12,309 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. [2018-11-23 06:05:12,310 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 [2018-11-23 06:05:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:05:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 06:05:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:05:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:12,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 06:05:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 06:05:12,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:05:12,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 06:05:12,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:05:12,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 06:05:12,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:05:12,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:05:12,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:05:12,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:05:12,313 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:05:12,313 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:05:12,313 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:05:12,314 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:05:12,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:05:12,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:05:12,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:05:12,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:05:12 BoogieIcfgContainer [2018-11-23 06:05:12,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:05:12,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:05:12,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:05:12,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:05:12,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:05:05" (3/4) ... [2018-11-23 06:05:12,323 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:05:12,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:05:12,324 INFO L168 Benchmark]: Toolchain (without parser) took 7378.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 419.4 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -432.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:05:12,325 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:05:12,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -199.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:05:12,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:05:12,326 INFO L168 Benchmark]: Boogie Preprocessor took 16.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:05:12,326 INFO L168 Benchmark]: RCFGBuilder took 251.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:05:12,327 INFO L168 Benchmark]: BuchiAutomizer took 6739.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:05:12,327 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:05:12,330 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -199.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 251.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6739.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 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[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -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 6.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 112 SDslu, 57 SDs, 0 SdLazy, 97 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax105 hnf99 lsp87 ukn71 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp92 dnf701 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 121ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...