./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:13:07,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:13:07,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:13:07,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:13:07,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:13:07,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:13:07,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:13:07,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:13:07,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:13:07,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:13:07,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:13:07,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:13:07,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:13:07,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:13:07,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:13:07,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:13:07,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:13:07,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:13:07,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:13:07,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:13:07,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:13:07,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:13:07,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:13:07,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:13:07,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:13:07,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:13:07,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:13:07,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:13:07,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:13:07,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:13:07,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:13:07,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:13:07,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:13:07,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:13:07,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:13:07,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:13:07,356 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:13:07,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:13:07,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:13:07,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:13:07,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:13:07,368 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:13:07,368 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:13:07,368 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:13:07,368 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:13:07,369 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:13:07,369 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:13:07,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:13:07,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:13:07,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:13:07,371 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:13:07,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:13:07,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:13:07,372 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:13:07,373 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:13:07,373 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 [2018-11-23 03:13:07,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:13:07,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:13:07,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:13:07,406 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:13:07,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:13:07,407 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2018-11-23 03:13:07,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/data/33ab5d75c/6491e6ddd8e24d8487b16df59a7aff2e/FLAGa9ad91eed [2018-11-23 03:13:07,836 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:13:07,837 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2_true-termination.c.i [2018-11-23 03:13:07,841 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/data/33ab5d75c/6491e6ddd8e24d8487b16df59a7aff2e/FLAGa9ad91eed [2018-11-23 03:13:07,850 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/data/33ab5d75c/6491e6ddd8e24d8487b16df59a7aff2e [2018-11-23 03:13:07,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:13:07,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:13:07,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:13:07,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:13:07,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:13:07,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:07" (1/1) ... [2018-11-23 03:13:07,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e873bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:07, skipping insertion in model container [2018-11-23 03:13:07,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:07" (1/1) ... [2018-11-23 03:13:07,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:13:07,878 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:13:07,985 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:13:07,991 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:13:08,002 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:13:08,011 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:13:08,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08 WrapperNode [2018-11-23 03:13:08,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:13:08,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:13:08,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:13:08,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:13:08,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:13:08,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:13:08,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:13:08,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:13:08,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... [2018-11-23 03:13:08,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:13:08,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:13:08,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:13:08,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:13:08,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48fff5a4-f365-4182-a6db-dae2039ea6ef/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2018-11-23 03:13:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2018-11-23 03:13:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:13:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:13:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:13:08,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:13:08,293 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 03:13:08,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:08 BoogieIcfgContainer [2018-11-23 03:13:08,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:13:08,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:13:08,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:13:08,298 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:13:08,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:08,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:13:07" (1/3) ... [2018-11-23 03:13:08,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627b4ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:13:08, skipping insertion in model container [2018-11-23 03:13:08,300 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:08,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:08" (2/3) ... [2018-11-23 03:13:08,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627b4ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:13:08, skipping insertion in model container [2018-11-23 03:13:08,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:08,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:08" (3/3) ... [2018-11-23 03:13:08,303 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2_true-termination.c.i [2018-11-23 03:13:08,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:13:08,351 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:13:08,351 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:13:08,351 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:13:08,351 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:13:08,351 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:13:08,351 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:13:08,351 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:13:08,351 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:13:08,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 03:13:08,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:13:08,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:08,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:08,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:13:08,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:08,397 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:13:08,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 03:13:08,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:13:08,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:08,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:08,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:13:08,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:08,405 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 16#L43true assume main_~length~1 < 1;main_~length~1 := 1; 11#L43-2true build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 20#L12true main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 22#L34true call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 6#rec_cstrlenENTRYtrue [2018-11-23 03:13:08,405 INFO L796 eck$LassoCheckResult]: Loop: 6#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 8#L17true assume !(0 == #t~mem2);havoc #t~mem2; 14#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 6#rec_cstrlenENTRYtrue [2018-11-23 03:13:08,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2018-11-23 03:13:08,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2018-11-23 03:13:08,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2018-11-23 03:13:08,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:08,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:08,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:13:08,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:13:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:13:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:13:08,762 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2018-11-23 03:13:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:13:08,893 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 03:13:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:13:08,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2018-11-23 03:13:08,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:13:08,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2018-11-23 03:13:08,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 03:13:08,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:13:08,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-23 03:13:08,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:13:08,906 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 03:13:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-23 03:13:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 03:13:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:13:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 03:13:08,931 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 03:13:08,931 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 03:13:08,931 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:13:08,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-23 03:13:08,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:13:08,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:08,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:08,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:13:08,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:08,933 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 99#L43 assume !(main_~length~1 < 1); 102#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 106#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 93#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 100#rec_cstrlenENTRY [2018-11-23 03:13:08,933 INFO L796 eck$LassoCheckResult]: Loop: 100#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 104#L17 assume !(0 == #t~mem2);havoc #t~mem2; 94#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 100#rec_cstrlenENTRY [2018-11-23 03:13:08,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2018-11-23 03:13:08,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2018-11-23 03:13:08,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2018-11-23 03:13:08,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:09,140 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-23 03:13:09,269 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:13:09,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:13:09,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:13:09,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:13:09,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:13:09,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:09,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:13:09,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:13:09,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration2_Lasso [2018-11-23 03:13:09,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:13:09,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:13:09,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:09,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:13:09,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:13:09,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:09,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:09,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:09,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:09,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:09,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,602 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:13:09,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:13:09,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:09,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:09,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,611 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:13:09,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:13:09,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:09,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:09,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:09,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:09,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:09,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:09,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:09,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:09,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:09,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:09,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:09,643 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:13:09,659 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:13:09,659 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:13:09,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:13:09,662 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:13:09,662 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:13:09,663 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2018-11-23 03:13:09,665 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 03:13:09,670 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:13:09,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:09,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:09,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:09,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:13:09,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 03:13:09,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 8 states. [2018-11-23 03:13:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:13:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:13:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 03:13:09,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:13:09,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:09,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 03:13:09,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:09,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 03:13:09,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:09,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-23 03:13:09,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:09,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2018-11-23 03:13:09,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 03:13:09,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 03:13:09,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-23 03:13:09,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:13:09,786 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 03:13:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-23 03:13:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-23 03:13:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 03:13:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 03:13:09,789 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 03:13:09,789 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 03:13:09,789 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:13:09,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-23 03:13:09,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:09,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:09,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:09,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:13:09,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:09,791 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 223#L43 assume !(main_~length~1 < 1); 225#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 231#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 210#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 212#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 214#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 209#rec_cstrlenFINAL assume true; 211#rec_cstrlenEXIT >#41#return; 226#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.alloc(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 206#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 207#rec_strcopy_helperENTRY [2018-11-23 03:13:09,791 INFO L796 eck$LassoCheckResult]: Loop: 207#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 208#L28 assume 0 != #t~mem5;havoc #t~mem5; 205#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 207#rec_strcopy_helperENTRY [2018-11-23 03:13:09,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2018-11-23 03:13:09,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:09,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:09,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:09,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:09,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2018-11-23 03:13:09,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:09,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:09,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:09,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:09,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2018-11-23 03:13:09,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:09,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:13:09,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 03:13:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:13:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:13:10,012 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2018-11-23 03:13:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:13:10,100 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 03:13:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:13:10,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2018-11-23 03:13:10,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:10,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2018-11-23 03:13:10,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 03:13:10,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 03:13:10,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-23 03:13:10,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:13:10,102 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 03:13:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-23 03:13:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 03:13:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 03:13:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 03:13:10,104 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 03:13:10,104 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 03:13:10,105 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:13:10,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-23 03:13:10,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:10,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:10,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:10,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:13:10,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:10,106 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 311#L43 assume !(main_~length~1 < 1); 308#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 309#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 299#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 298#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 300#L17 assume !(0 == #t~mem2);havoc #t~mem2; 302#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 301#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 303#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 304#rec_cstrlenFINAL assume true; 305#rec_cstrlenEXIT >#45#return; 306#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 307#rec_cstrlenFINAL assume true; 314#rec_cstrlenEXIT >#41#return; 313#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.alloc(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 295#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 296#rec_strcopy_helperENTRY [2018-11-23 03:13:10,106 INFO L796 eck$LassoCheckResult]: Loop: 296#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 297#L28 assume 0 != #t~mem5;havoc #t~mem5; 294#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 296#rec_strcopy_helperENTRY [2018-11-23 03:13:10,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2018-11-23 03:13:10,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:10,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2018-11-23 03:13:10,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:10,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2018-11-23 03:13:10,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:10,595 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-11-23 03:13:10,808 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:13:10,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:13:10,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:13:10,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:13:10,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:13:10,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:10,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:13:10,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:13:10,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2_true-termination.c.i_Iteration4_Lasso [2018-11-23 03:13:10,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:13:10,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:13:10,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:10,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:11,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:13:11,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:13:11,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:11,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:11,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:11,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:11,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:11,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:11,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:11,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:11,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:11,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,186 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:13:11,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:13:11,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:11,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:11,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:11,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:11,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:11,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:11,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:11,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:11,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:11,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:13:11,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:13:11,224 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:13:11,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:13:11,225 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:13:11,225 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:13:11,226 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~source.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~source.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2018-11-23 03:13:11,253 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 03:13:11,254 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:13:11,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:11,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:11,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:11,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-23 03:13:11,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-23 03:13:11,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 33 states and 36 transitions. Complement of second has 12 states. [2018-11-23 03:13:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:13:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:13:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-23 03:13:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 03:13:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-23 03:13:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-23 03:13:11,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:11,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-23 03:13:11,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:13:11,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2018-11-23 03:13:11,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:13:11,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:13:11,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:13:11,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:13:11,522 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:11,522 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:11,522 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:11,522 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:13:11,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:13:11,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:13:11,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:13:11,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:13:11 BoogieIcfgContainer [2018-11-23 03:13:11,526 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:13:11,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:13:11,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:13:11,527 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:13:11,527 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:08" (3/4) ... [2018-11-23 03:13:11,530 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:13:11,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:13:11,530 INFO L168 Benchmark]: Toolchain (without parser) took 3677.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 959.3 MB in the beginning and 979.4 MB in the end (delta: -20.1 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,531 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:13:11,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.30 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,532 INFO L168 Benchmark]: Boogie Preprocessor took 54.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,533 INFO L168 Benchmark]: RCFGBuilder took 203.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,533 INFO L168 Benchmark]: BuchiAutomizer took 3231.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 134.1 MB). Peak memory consumption was 179.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:11,534 INFO L168 Benchmark]: Witness Printer took 3.39 ms. Allocated memory is still 1.2 GB. Free memory is still 979.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:13:11,536 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 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 24.30 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3231.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 134.1 MB). Peak memory consumption was 179.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.39 ms. Allocated memory is still 1.2 GB. Free memory is still 979.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[source] + -1 * dest and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.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 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 45 SDslu, 237 SDs, 0 SdLazy, 151 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf100 lsp95 ukn57 mio100 lsp51 div100 bol100 ite100 ukn100 eq171 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...