./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:42,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:42,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:42,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:42,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:42,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:42,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:42,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:42,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:42,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:42,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:42,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:42,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:42,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:42,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:42,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:42,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:42,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:42,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:42,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:42,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:42,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:42,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:42,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:42,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:42,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:42,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:42,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:42,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:42,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:42,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:42,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:42,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:42,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:42,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:42,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:42,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:42,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:42,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:42,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:42,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:42,403 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:42,404 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:42,404 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:42,404 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:42,404 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:42,404 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:42,404 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:42,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:42,405 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:42,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:42,407 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:42,407 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:42,407 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:42,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:42,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:42,408 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:42,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:42,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:42,409 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:42,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:42,410 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 [2018-11-28 23:24:42,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:42,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:42,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:42,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:42,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:42,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2018-11-28 23:24:42,547 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefbb583a/6a7516943677416c8d87c3ceca03eb5a/FLAGad9924eaa [2018-11-28 23:24:42,984 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:42,984 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2018-11-28 23:24:42,990 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefbb583a/6a7516943677416c8d87c3ceca03eb5a/FLAGad9924eaa [2018-11-28 23:24:43,354 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefbb583a/6a7516943677416c8d87c3ceca03eb5a [2018-11-28 23:24:43,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:43,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:43,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:43,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:43,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:43,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2826fdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43, skipping insertion in model container [2018-11-28 23:24:43,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:43,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:43,653 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:43,676 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:43,705 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:43,726 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:43,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43 WrapperNode [2018-11-28 23:24:43,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:43,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:43,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:43,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:43,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:43,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:43,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:43,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:43,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... [2018-11-28 23:24:43,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:43,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:43,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:43,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:43,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:24:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2018-11-28 23:24:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2018-11-28 23:24:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2018-11-28 23:24:43,933 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2018-11-28 23:24:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:43,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:44,313 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:44,314 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:24:44,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:44 BoogieIcfgContainer [2018-11-28 23:24:44,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:44,315 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:44,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:44,319 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:44,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:44,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:43" (1/3) ... [2018-11-28 23:24:44,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@692cde34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:44, skipping insertion in model container [2018-11-28 23:24:44,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:44,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:43" (2/3) ... [2018-11-28 23:24:44,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@692cde34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:44, skipping insertion in model container [2018-11-28 23:24:44,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:44,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:44" (3/3) ... [2018-11-28 23:24:44,325 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2_true-termination.c.i [2018-11-28 23:24:44,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:44,389 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:44,389 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:44,389 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:44,389 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:44,389 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:44,390 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:44,390 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:44,390 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:44,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 23:24:44,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:44,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:44,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:44,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:24:44,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:44,445 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:44,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 23:24:44,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:44,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:44,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:44,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:24:44,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:44,458 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 16#L43true assume main_~length~1 < 1;main_~length~1 := 1; 11#L43-2true build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 20#L12true main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 22#L34true call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 6#rec_cstrlenENTRYtrue [2018-11-28 23:24:44,458 INFO L796 eck$LassoCheckResult]: Loop: 6#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 8#L17true assume !(0 == #t~mem2);havoc #t~mem2; 14#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 6#rec_cstrlenENTRYtrue [2018-11-28 23:24:44,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2018-11-28 23:24:44,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:44,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:44,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2018-11-28 23:24:44,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:44,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2018-11-28 23:24:44,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:44,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:45,022 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-28 23:24:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:45,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:24:45,316 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:24:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:24:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:24:45,423 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2018-11-28 23:24:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:45,811 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-28 23:24:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:45,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2018-11-28 23:24:45,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:45,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2018-11-28 23:24:45,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:24:45,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:24:45,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-28 23:24:45,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:45,831 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-28 23:24:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-28 23:24:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-28 23:24:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:24:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 23:24:45,871 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:24:45,872 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:24:45,872 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:45,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-28 23:24:45,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:45,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:45,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:45,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:24:45,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:45,875 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 99#L43 assume !(main_~length~1 < 1); 102#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 106#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 93#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 100#rec_cstrlenENTRY [2018-11-28 23:24:45,875 INFO L796 eck$LassoCheckResult]: Loop: 100#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 104#L17 assume !(0 == #t~mem2);havoc #t~mem2; 94#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 100#rec_cstrlenENTRY [2018-11-28 23:24:45,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2018-11-28 23:24:45,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:45,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:45,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2018-11-28 23:24:45,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:45,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2018-11-28 23:24:45,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:45,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:46,287 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:24:47,034 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-28 23:24:47,293 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:47,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:47,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:47,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:47,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:47,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:47,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:47,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:47,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:24:47,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:47,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:47,321 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-28 23:24:47,332 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-28 23:24:47,342 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-28 23:24:47,347 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-28 23:24:47,350 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-28 23:24:47,353 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-28 23:24:47,356 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-28 23:24:47,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-28 23:24:47,369 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-28 23:24:47,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-28 23:24:47,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-28 23:24:47,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-28 23:24:47,399 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-28 23:24:47,404 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-28 23:24:47,407 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-28 23:24:47,414 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-28 23:24:47,417 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-28 23:24:47,419 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-28 23:24:47,423 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-28 23:24:47,425 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-28 23:24:47,429 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-28 23:24:47,444 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-28 23:24:47,448 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-28 23:24:47,456 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-28 23:24:47,459 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-28 23:24:47,462 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-28 23:24:47,465 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-28 23:24:47,472 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-28 23:24:47,474 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-28 23:24:47,476 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-28 23:24:47,551 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-28 23:24:47,553 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-28 23:24:47,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-28 23:24:47,562 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-28 23:24:47,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-28 23:24:47,569 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-28 23:24:47,572 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-28 23:24:47,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-28 23:24:47,585 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-28 23:24:47,587 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-28 23:24:47,589 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-28 23:24:47,591 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-28 23:24:47,595 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-28 23:24:47,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-28 23:24:47,600 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-28 23:24:47,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:47,973 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:47,976 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-28 23:24:47,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:47,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:47,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:47,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:47,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:47,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:47,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:47,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:47,986 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-28 23:24:47,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:47,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:47,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:47,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:47,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:47,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:47,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:47,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:47,990 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-28 23:24:47,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:47,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:47,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:47,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:47,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:47,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:47,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:47,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:47,994 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-28 23:24:47,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:47,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:47,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:47,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:47,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:47,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:47,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:47,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:47,997 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-28 23:24:47,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:47,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:47,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:47,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:47,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:47,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,001 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-28 23:24:48,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,004 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-28 23:24:48,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:48,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:48,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,013 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-28 23:24:48,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,017 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-28 23:24:48,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,020 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-28 23:24:48,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,024 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-28 23:24:48,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,027 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-28 23:24:48,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,036 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-28 23:24:48,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,042 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-28 23:24:48,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,048 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-28 23:24:48,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,054 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-28 23:24:48,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,060 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-28 23:24:48,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,068 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-28 23:24:48,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,073 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-28 23:24:48,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,079 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-28 23:24:48,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:48,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:48,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,098 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-28 23:24:48,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,107 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-28 23:24:48,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,121 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-28 23:24:48,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,130 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-28 23:24:48,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,135 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-28 23:24:48,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,147 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-28 23:24:48,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,154 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-28 23:24:48,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,161 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-28 23:24:48,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:48,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,169 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-28 23:24:48,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,170 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:48,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,176 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:48,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:48,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,186 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-28 23:24:48,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:48,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,189 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:48,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,190 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:24:48,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:48,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,195 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-28 23:24:48,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:48,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:48,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:48,215 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-28 23:24:48,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:48,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:48,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:48,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:48,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:48,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:48,240 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:48,263 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:48,264 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:48,269 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:48,271 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:48,271 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:48,272 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2018-11-28 23:24:48,283 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:48,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:48,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:48,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:48,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:48,473 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-28 23:24:48,477 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-28 23:24:48,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:24:48,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 8 states. [2018-11-28 23:24:48,602 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-28 23:24:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-28 23:24:48,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:24:48,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:24:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:24:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:48,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-28 23:24:48,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:48,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2018-11-28 23:24:48,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:24:48,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:24:48,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-28 23:24:48,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:48,618 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 23:24:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-28 23:24:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-28 23:24:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:24:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 23:24:48,623 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 23:24:48,623 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 23:24:48,623 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:48,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-28 23:24:48,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:48,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:48,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:48,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:48,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:48,627 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 223#L43 assume !(main_~length~1 < 1); 225#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 231#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 210#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 212#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 214#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 209#rec_cstrlenFINAL assume true; 211#rec_cstrlenEXIT >#41#return; 226#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.alloc(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 206#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 207#rec_strcopy_helperENTRY [2018-11-28 23:24:48,627 INFO L796 eck$LassoCheckResult]: Loop: 207#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 208#L28 assume 0 != #t~mem5;havoc #t~mem5; 205#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 207#rec_strcopy_helperENTRY [2018-11-28 23:24:48,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2018-11-28 23:24:48,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:48,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2018-11-28 23:24:48,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:48,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:48,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2018-11-28 23:24:48,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:48,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:48,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:48,901 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-28 23:24:48,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:48,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 23:24:49,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:24:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:24:49,158 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2018-11-28 23:24:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:49,475 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 23:24:49,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:24:49,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2018-11-28 23:24:49,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:49,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2018-11-28 23:24:49,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:24:49,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:24:49,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-28 23:24:49,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:49,481 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:24:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-28 23:24:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 23:24:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:24:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-28 23:24:49,485 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:24:49,485 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:24:49,485 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:49,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-28 23:24:49,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:49,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:49,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:49,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:49,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:49,487 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 311#L43 assume !(main_~length~1 < 1); 308#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 309#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 299#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 298#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 300#L17 assume !(0 == #t~mem2);havoc #t~mem2; 302#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 301#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 303#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 304#rec_cstrlenFINAL assume true; 305#rec_cstrlenEXIT >#45#return; 306#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 307#rec_cstrlenFINAL assume true; 314#rec_cstrlenEXIT >#41#return; 313#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.alloc(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 295#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 296#rec_strcopy_helperENTRY [2018-11-28 23:24:49,488 INFO L796 eck$LassoCheckResult]: Loop: 296#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 297#L28 assume 0 != #t~mem5;havoc #t~mem5; 294#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 296#rec_strcopy_helperENTRY [2018-11-28 23:24:49,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2018-11-28 23:24:49,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:49,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:49,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:49,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2018-11-28 23:24:49,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2018-11-28 23:24:49,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:49,755 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:24:50,242 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-11-28 23:24:50,798 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 114 [2018-11-28 23:24:50,955 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 23:24:51,145 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-28 23:24:51,215 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:51,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:51,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:51,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:51,216 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:51,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:51,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:51,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:51,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:24:51,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:51,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:51,223 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-28 23:24:51,228 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-28 23:24:51,233 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-28 23:24:51,237 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-28 23:24:51,241 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-28 23:24:51,244 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-28 23:24:51,250 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-28 23:24:51,254 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-28 23:24:51,257 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-28 23:24:51,265 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-28 23:24:51,267 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-28 23:24:51,273 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-28 23:24:51,289 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-28 23:24:51,292 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-28 23:24:51,296 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-28 23:24:51,306 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-28 23:24:51,312 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-28 23:24:51,314 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-28 23:24:51,317 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-28 23:24:51,327 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-28 23:24:51,330 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-28 23:24:51,332 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-28 23:24:51,335 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-28 23:24:51,337 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-28 23:24:51,344 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-28 23:24:51,351 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-28 23:24:51,379 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-28 23:24:51,404 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-28 23:24:51,406 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-28 23:24:51,408 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-28 23:24:51,726 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-11-28 23:24:51,726 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-28 23:24:51,732 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-28 23:24:51,733 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-28 23:24:51,736 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-28 23:24:51,738 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-28 23:24:51,741 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-28 23:24:51,743 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-28 23:24:51,746 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-28 23:24:51,748 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-28 23:24:51,751 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-28 23:24:51,753 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-28 23:24:51,759 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-28 23:24:51,760 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-28 23:24:51,762 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-28 23:24:51,764 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-28 23:24:52,207 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:52,208 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:52,208 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-28 23:24:52,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,217 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-28 23:24:52,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,221 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-28 23:24:52,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,234 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-28 23:24:52,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,242 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-28 23:24:52,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,252 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-28 23:24:52,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,262 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-28 23:24:52,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,276 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-28 23:24:52,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,281 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-28 23:24:52,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,290 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-28 23:24:52,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,298 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-28 23:24:52,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:52,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:52,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,312 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-28 23:24:52,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,322 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-28 23:24:52,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,332 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-28 23:24:52,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,341 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-28 23:24:52,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,348 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-28 23:24:52,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,351 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-28 23:24:52,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,360 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-28 23:24:52,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,364 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-28 23:24:52,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,368 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-28 23:24:52,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,371 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-28 23:24:52,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,377 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-28 23:24:52,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:52,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:52,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,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-28 23:24:52,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:52,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:52,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:52,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,401 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-28 23:24:52,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:52,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:52,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,412 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-28 23:24:52,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,415 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:52,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,418 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:52,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:52,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:52,425 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-28 23:24:52,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:52,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:52,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:52,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:52,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:52,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:52,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:52,528 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:52,531 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:52,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:52,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:52,535 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:52,536 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~source.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~source.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2018-11-28 23:24:52,670 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 23:24:52,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:52,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:52,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:53,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:53,355 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-28 23:24:53,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-28 23:24:53,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 23:24:53,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 33 states and 36 transitions. Complement of second has 12 states. [2018-11-28 23:24:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-28 23:24:53,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:24:53,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:53,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 23:24:53,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:53,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-28 23:24:53,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:53,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-28 23:24:53,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:53,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2018-11-28 23:24:53,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:53,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:53,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:53,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:53,538 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:53,539 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:53,539 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:53,539 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:53,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:53,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:53,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:53,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:53 BoogieIcfgContainer [2018-11-28 23:24:53,546 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:53,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:53,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:53,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:53,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:44" (3/4) ... [2018-11-28 23:24:53,551 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:53,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:53,552 INFO L168 Benchmark]: Toolchain (without parser) took 10192.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -349.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:53,553 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:53,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:53,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:53,555 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:53,556 INFO L168 Benchmark]: RCFGBuilder took 518.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:53,557 INFO L168 Benchmark]: BuchiAutomizer took 9230.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:53,558 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:53,563 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.71 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 518.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9230.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[source] + -1 * dest and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 45 SDslu, 237 SDs, 0 SdLazy, 151 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp94 ukn56 mio100 lsp50 div100 bol100 ite100 ukn100 eq173 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...