./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 0ed9222f 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-0ed9222-m [2019-01-14 02:49:10,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:10,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:10,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:10,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:10,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:10,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:10,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:10,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:10,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:10,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:10,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:10,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:10,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:10,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:10,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:10,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:10,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:10,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:10,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:10,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:10,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:10,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:10,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:10,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:10,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:10,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:10,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:10,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:10,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:10,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:10,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:10,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:10,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:10,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:10,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:10,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:49:10,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:10,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:10,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:10,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:10,588 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:10,588 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:10,589 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:10,589 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:10,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:10,589 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:10,589 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:10,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:10,591 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:10,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:10,592 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:10,593 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:10,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:10,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:10,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:10,596 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:10,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:10,597 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:10,597 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:10,599 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:10,599 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 [2019-01-14 02:49:10,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:10,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:10,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:10,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:10,678 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:10,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2019-01-14 02:49:10,758 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f35d5db/6d4bd5a7c1804083ba58ebc048bd8d82/FLAGee37ea637 [2019-01-14 02:49:11,248 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:11,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2019-01-14 02:49:11,255 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f35d5db/6d4bd5a7c1804083ba58ebc048bd8d82/FLAGee37ea637 [2019-01-14 02:49:11,578 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f35d5db/6d4bd5a7c1804083ba58ebc048bd8d82 [2019-01-14 02:49:11,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:11,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:11,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:11,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:11,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:11,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ff57f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11, skipping insertion in model container [2019-01-14 02:49:11,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:11,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:11,807 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:11,821 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:11,842 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:11,863 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:11,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11 WrapperNode [2019-01-14 02:49:11,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:11,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:11,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:11,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:11,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:11,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:11,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:11,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:11,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (1/1) ... [2019-01-14 02:49:11,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:11,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:11,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:11,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:11,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (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 [2019-01-14 02:49:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-01-14 02:49:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-01-14 02:49:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2019-01-14 02:49:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2019-01-14 02:49:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:49:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:49:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:12,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:12,485 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:12,486 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:12,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:12 BoogieIcfgContainer [2019-01-14 02:49:12,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:12,488 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:12,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:12,492 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:12,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:12,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:11" (1/3) ... [2019-01-14 02:49:12,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bbe1918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:12, skipping insertion in model container [2019-01-14 02:49:12,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:12,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:11" (2/3) ... [2019-01-14 02:49:12,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bbe1918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:12, skipping insertion in model container [2019-01-14 02:49:12,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:12,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:12" (3/3) ... [2019-01-14 02:49:12,498 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2_true-termination.c.i [2019-01-14 02:49:12,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:12,558 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:12,559 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:12,559 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:12,559 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:12,559 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:12,559 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:12,559 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:12,559 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:12,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:49:12,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:49:12,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:12,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:12,611 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:12,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:12,612 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:12,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:49:12,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:49:12,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:12,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:12,616 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:12,616 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:12,623 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.allocOnHeap(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 [2019-01-14 02:49:12,624 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 [2019-01-14 02:49:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2019-01-14 02:49:12,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:12,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2019-01-14 02:49:12,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:12,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:12,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2019-01-14 02:49:12,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:12,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:12,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:12,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:13,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:13,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:49:13,421 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 02:49:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:49:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:49:13,493 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-01-14 02:49:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:13,864 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 02:49:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:49:13,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2019-01-14 02:49:13,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:49:13,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2019-01-14 02:49:13,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 02:49:13,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:49:13,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-01-14 02:49:13,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:13,881 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-14 02:49:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-01-14 02:49:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-14 02:49:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:49:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-14 02:49:13,912 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:49:13,912 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:49:13,913 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:13,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-14 02:49:13,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:49:13,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:13,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:13,915 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:13,915 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:13,916 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.allocOnHeap(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 [2019-01-14 02:49:13,916 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 [2019-01-14 02:49:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2019-01-14 02:49:13,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:13,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2019-01-14 02:49:13,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:13,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:13,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:13,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2019-01-14 02:49:13,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:14,745 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-01-14 02:49:14,950 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-14 02:49:15,018 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:15,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:15,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:15,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:15,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:15,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:15,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:15,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:15,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:49:15,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:15,021 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:15,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:15,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:15,691 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:15,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,719 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 [2019-01-14 02:49:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:15,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:15,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:15,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,749 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 [2019-01-14 02:49:15,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,755 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 [2019-01-14 02:49:15,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,761 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 [2019-01-14 02:49:15,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,768 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 [2019-01-14 02:49:15,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:15,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,774 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 [2019-01-14 02:49:15,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:15,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:49:15,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:49:15,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:15,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,784 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 [2019-01-14 02:49:15,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:15,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:15,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:15,809 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 [2019-01-14 02:49:15,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:15,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:15,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:15,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:15,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:15,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:15,839 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:15,870 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:49:15,870 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:49:15,881 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:15,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:15,884 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:15,884 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 [] [2019-01-14 02:49:15,914 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:49:15,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:49:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:16,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:16,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:16,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:49:16,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:49:16,198 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. [2019-01-14 02:49:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 02:49:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:49:16,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:16,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:49:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:16,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:49:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:16,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2019-01-14 02:49:16,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:16,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2019-01-14 02:49:16,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 02:49:16,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:49:16,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2019-01-14 02:49:16,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:49:16,214 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-01-14 02:49:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2019-01-14 02:49:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-14 02:49:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 02:49:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 02:49:16,219 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 02:49:16,219 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 02:49:16,219 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:16,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-01-14 02:49:16,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:16,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:16,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:16,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:49:16,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:16,222 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.allocOnHeap(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.allocOnHeap(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 [2019-01-14 02:49:16,223 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 [2019-01-14 02:49:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2019-01-14 02:49:16,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:16,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2019-01-14 02:49:16,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:16,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2019-01-14 02:49:16,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:16,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:16,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:16,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 02:49:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:49:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:49:16,786 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-01-14 02:49:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:17,000 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-14 02:49:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:49:17,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2019-01-14 02:49:17,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:17,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2019-01-14 02:49:17,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:49:17,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 02:49:17,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-01-14 02:49:17,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:49:17,029 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-14 02:49:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-01-14 02:49:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 02:49:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:49:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-14 02:49:17,036 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-14 02:49:17,036 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-14 02:49:17,036 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:49:17,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-01-14 02:49:17,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:17,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:17,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:17,039 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:49:17,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:17,041 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.allocOnHeap(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.allocOnHeap(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 [2019-01-14 02:49:17,041 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 [2019-01-14 02:49:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2019-01-14 02:49:17,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2019-01-14 02:49:17,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2019-01-14 02:49:17,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:17,300 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:49:17,451 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:49:17,694 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 02:49:18,078 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-14 02:49:18,658 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2019-01-14 02:49:18,802 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-01-14 02:49:19,011 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-14 02:49:19,071 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:19,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:19,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:19,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:19,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:19,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:19,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:19,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:19,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:49:19,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:19,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:19,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,500 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-14 02:49:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:19,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:20,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:20,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:20,088 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 [2019-01-14 02:49:20,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,095 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 [2019-01-14 02:49:20,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,101 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 [2019-01-14 02:49:20,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,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 [2019-01-14 02:49:20,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,114 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 [2019-01-14 02:49:20,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,119 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 [2019-01-14 02:49:20,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,127 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 [2019-01-14 02:49:20,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,133 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 [2019-01-14 02:49:20,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,141 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 [2019-01-14 02:49:20,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,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 [2019-01-14 02:49:20,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,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 [2019-01-14 02:49:20,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,160 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 [2019-01-14 02:49:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,167 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 [2019-01-14 02:49:20,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,174 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 [2019-01-14 02:49:20,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:20,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:20,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,184 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 [2019-01-14 02:49:20,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,190 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 [2019-01-14 02:49:20,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,197 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 [2019-01-14 02:49:20,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,204 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 [2019-01-14 02:49:20,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,209 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 [2019-01-14 02:49:20,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,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 [2019-01-14 02:49:20,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,222 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 [2019-01-14 02:49:20,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,229 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 [2019-01-14 02:49:20,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,236 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 [2019-01-14 02:49:20,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,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 [2019-01-14 02:49:20,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:20,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:20,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:20,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,253 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 [2019-01-14 02:49:20,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:20,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:20,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,263 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 [2019-01-14 02:49:20,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,264 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:49:20,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,270 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:49:20,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:20,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:20,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:20,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:20,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:20,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:20,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:20,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:20,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:20,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:20,338 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:49:20,338 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:49:20,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:20,341 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:20,341 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:20,341 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~dest.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~dest.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2019-01-14 02:49:20,431 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 02:49:20,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:49:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:20,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:20,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:20,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:49:20,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:49:20,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 33 states and 36 transitions. Complement of second has 9 states. [2019-01-14 02:49:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:49:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 02:49:20,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:49:20,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:20,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-14 02:49:20,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:20,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 02:49:20,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:20,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-01-14 02:49:20,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:20,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-01-14 02:49:20,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:20,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:20,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:20,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:20,716 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:20,716 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:20,716 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:20,716 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:49:20,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:20,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:20,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:20,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:20 BoogieIcfgContainer [2019-01-14 02:49:20,724 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:20,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:20,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:20,725 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:20,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:12" (3/4) ... [2019-01-14 02:49:20,729 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:20,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:20,730 INFO L168 Benchmark]: Toolchain (without parser) took 9147.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 951.4 MB in the beginning and 793.5 MB in the end (delta: 157.9 MB). Peak memory consumption was 361.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:20,731 INFO L168 Benchmark]: CDTParser took 0.38 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. [2019-01-14 02:49:20,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:20,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:20,733 INFO L168 Benchmark]: Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:20,734 INFO L168 Benchmark]: RCFGBuilder took 544.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:20,735 INFO L168 Benchmark]: BuchiAutomizer took 8235.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 793.5 MB in the end (delta: 303.2 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:20,736 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.2 GB. Free memory is still 793.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:20,742 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.38 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 279.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 51.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 544.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8235.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 793.5 MB in the end (delta: 303.2 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.2 GB. Free memory is still 793.5 MB. 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[dest] + -1 * dest and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. 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: 76 SDtfs, 43 SDslu, 221 SDs, 0 SdLazy, 141 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf100 lsp95 ukn58 mio100 lsp48 div100 bol100 ite100 ukn100 eq173 hnf90 smp100 dnf100 smp100 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...