./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc_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_malloc_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 cd11d9219c053905d9335ee000e770be1f4c60e6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:22,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:22,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:22,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:22,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:22,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:22,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:22,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:22,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:22,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:22,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:22,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:22,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:22,278 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:22,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:22,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:22,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:22,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:22,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:22,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:22,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:22,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:22,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:22,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:22,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:22,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:22,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:22,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:22,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:22,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:22,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:22,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:22,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:22,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:22,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:22,310 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:22,342 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:22,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:22,344 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:22,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:22,344 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:22,345 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:22,345 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:22,345 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:22,346 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:22,346 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:22,346 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:22,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:22,346 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:22,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:22,348 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:22,349 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:22,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:22,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:22,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:22,350 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:22,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:22,351 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:22,352 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:22,353 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:22,353 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 -> cd11d9219c053905d9335ee000e770be1f4c60e6 [2019-01-14 02:49:22,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:22,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:22,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:22,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:22,434 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:22,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i [2019-01-14 02:49:22,486 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f5c9d3b/56f425ad434a4ba8902ee952489aa5b0/FLAG8b963b0a5 [2019-01-14 02:49:22,969 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:22,970 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_strcopy_malloc_true-termination.c.i [2019-01-14 02:49:22,976 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f5c9d3b/56f425ad434a4ba8902ee952489aa5b0/FLAG8b963b0a5 [2019-01-14 02:49:23,337 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f5c9d3b/56f425ad434a4ba8902ee952489aa5b0 [2019-01-14 02:49:23,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:23,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:23,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:23,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:23,350 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:23,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:23" (1/1) ... [2019-01-14 02:49:23,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0aad85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:23, skipping insertion in model container [2019-01-14 02:49:23,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:23" (1/1) ... [2019-01-14 02:49:23,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:23,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:23,616 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:23,629 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:23,650 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:23,673 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:23,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:23 WrapperNode [2019-01-14 02:49:23,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:23,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:23,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:23,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:23,686 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:23" (1/1) ... [2019-01-14 02:49:23,701 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:23" (1/1) ... [2019-01-14 02:49:23,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:23,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:23,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:23,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:23,742 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:23" (1/1) ... [2019-01-14 02:49:23,743 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:23" (1/1) ... [2019-01-14 02:49:23,746 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:23" (1/1) ... [2019-01-14 02:49:23,747 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:23" (1/1) ... [2019-01-14 02:49:23,755 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:23" (1/1) ... [2019-01-14 02:49:23,760 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:23" (1/1) ... [2019-01-14 02:49:23,761 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:23" (1/1) ... [2019-01-14 02:49:23,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:23,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:23,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:23,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:23,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:23" (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:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-01-14 02:49:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-01-14 02:49:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:49:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:49:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:24,201 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:24,202 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:24,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:24 BoogieIcfgContainer [2019-01-14 02:49:24,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:24,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:24,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:24,210 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:24,211 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:24,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:23" (1/3) ... [2019-01-14 02:49:24,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a16bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:24, skipping insertion in model container [2019-01-14 02:49:24,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:24,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:23" (2/3) ... [2019-01-14 02:49:24,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a16bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:24, skipping insertion in model container [2019-01-14 02:49:24,215 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:24,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:24" (3/3) ... [2019-01-14 02:49:24,218 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc_true-termination.c.i [2019-01-14 02:49:24,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:24,311 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:24,311 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:24,312 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:24,312 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:24,312 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:24,312 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:24,312 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:24,313 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:24,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:49:24,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:24,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:24,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:24,360 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:24,360 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:24,360 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:24,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:49:24,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:24,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:24,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:24,364 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:24,364 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:24,371 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 17#L35true assume main_~length~0 < 1;main_~length~0 := 1; 12#L35-2true build_nondet_String_#in~length := main_~length~0;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; 15#L12true main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, 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;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.allocOnHeap(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 4#L28true call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 11#rec_strcopy_helperENTRYtrue [2019-01-14 02:49:24,371 INFO L796 eck$LassoCheckResult]: Loop: 11#rec_strcopy_helperENTRYtrue ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 7#L21true assume 0 != #t~mem3;havoc #t~mem3; 14#L22true call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 11#rec_strcopy_helperENTRYtrue [2019-01-14 02:49:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759793, now seen corresponding path program 1 times [2019-01-14 02:49:24,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:24,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2019-01-14 02:49:24,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:24,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1512818648, now seen corresponding path program 1 times [2019-01-14 02:49:24,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:24,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:24,991 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:24,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:24,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:49:25,260 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:49:25,397 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:49:25,599 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:49:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:49:25,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:49:25,687 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2019-01-14 02:49:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:26,000 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-14 02:49:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:49:26,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-01-14 02:49:26,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:26,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 9 transitions. [2019-01-14 02:49:26,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:49:26,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:49:26,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 9 transitions. [2019-01-14 02:49:26,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:26,015 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-14 02:49:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 9 transitions. [2019-01-14 02:49:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:49:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:49:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-14 02:49:26,047 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-14 02:49:26,047 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-14 02:49:26,047 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:26,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2019-01-14 02:49:26,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:49:26,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:26,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:26,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:49:26,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:26,050 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 68#L35 assume !(main_~length~0 < 1); 74#L35-2 build_nondet_String_#in~length := main_~length~0;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; 75#L12 main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, 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;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.allocOnHeap(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 72#L28 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 70#rec_strcopy_helperENTRY [2019-01-14 02:49:26,050 INFO L796 eck$LassoCheckResult]: Loop: 70#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~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 73#L21 assume 0 != #t~mem3;havoc #t~mem3; 71#L22 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 70#rec_strcopy_helperENTRY [2019-01-14 02:49:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819375, now seen corresponding path program 1 times [2019-01-14 02:49:26,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:26,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 2 times [2019-01-14 02:49:26,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:26,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:26,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:26,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 262188714, now seen corresponding path program 1 times [2019-01-14 02:49:26,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:26,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:26,372 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:49:26,598 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:49:27,268 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-01-14 02:49:27,424 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-14 02:49:27,606 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 02:49:27,703 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:27,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:27,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:27,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:27,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:27,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:27,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:27,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:27,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:49:27,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:27,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:27,727 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:27,743 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:27,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:27,756 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:27,763 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:27,770 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:27,773 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:27,775 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:27,778 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:27,783 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:27,786 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:27,794 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:27,801 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:27,803 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:27,805 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:27,807 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:27,811 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:27,822 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:27,824 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:27,838 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:28,024 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-01-14 02:49:28,143 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-14 02:49:28,144 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:28,147 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:28,148 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:28,151 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:28,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:28,157 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:28,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:28,162 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:28,164 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:28,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:28,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:28,173 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:28,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:28,177 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:28,185 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:28,187 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:28,189 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:28,192 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:28,195 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:28,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:28,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:28,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:28,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:28,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:28,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:28,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:28,815 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:28,817 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:28,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,826 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:28,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,829 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:28,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,832 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:28,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,835 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:28,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,838 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:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,841 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:28,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,844 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:28,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,847 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:28,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,850 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:28,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,853 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:28,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,856 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:28,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,858 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:28,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:28,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:28,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,867 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:28,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,870 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:28,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,873 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:28,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:28,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:28,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:28,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,876 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:28,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:28,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,883 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:28,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,884 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:49:28,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,896 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:49:28,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,943 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:28,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:28,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,956 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:28,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:28,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,967 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:28,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:28,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:28,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:28,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:28,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:28,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:28,993 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:28,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:28,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:28,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:28,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:29,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:29,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:29,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:29,106 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:49:29,108 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:49:29,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:29,113 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:29,118 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:29,120 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:29,165 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:49:29,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:49:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:29,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:29,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:29,403 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:29,406 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:29,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand 3 states. [2019-01-14 02:49:29,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1. Second operand 3 states. Result 16 states and 16 transitions. Complement of second has 7 states. [2019-01-14 02:49:29,468 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:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:49:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:49:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:49:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:49:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:29,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-01-14 02:49:29,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:29,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-01-14 02:49:29,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:29,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:29,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:29,479 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:29,479 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:29,479 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:29,479 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:29,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:29,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:29,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:29,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:29 BoogieIcfgContainer [2019-01-14 02:49:29,485 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:29,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:29,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:29,486 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:29,487 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:24" (3/4) ... [2019-01-14 02:49:29,491 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:29,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:29,492 INFO L168 Benchmark]: Toolchain (without parser) took 6148.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:29,494 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:29,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.58 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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:29,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.43 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:29,496 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 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:29,497 INFO L168 Benchmark]: RCFGBuilder took 438.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:29,499 INFO L168 Benchmark]: BuchiAutomizer took 5280.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.2 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:29,500 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:29,507 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.58 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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 55.43 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 438.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5280.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.2 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[dest] + -1 * dest and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 18 SDslu, 84 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital159 mio100 ax100 hnf100 lsp96 ukn65 mio100 lsp46 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms 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...