./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/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 77cd6aa75e9c7e5f4880befb873abc23862925a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:22:47,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:22:47,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:22:47,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:22:47,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:22:47,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:22:47,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:22:47,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:22:47,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:22:47,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:22:47,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:22:47,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:22:47,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:22:47,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:22:47,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:22:47,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:22:47,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:22:47,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:22:47,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:22:47,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:22:47,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:22:47,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:22:47,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:22:47,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:22:47,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:22:47,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:22:47,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:22:47,576 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:22:47,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:22:47,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:22:47,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:22:47,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:22:47,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:22:47,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:22:47,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:22:47,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:22:47,579 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 13:22:47,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:22:47,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:22:47,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:22:47,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:22:47,587 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:22:47,587 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 13:22:47,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 13:22:47,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 13:22:47,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 13:22:47,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:22:47,589 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 13:22:47,590 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 13:22:47,590 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_03d4f6c6-c961-4286-af23-8a1310da0fcd/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 -> 77cd6aa75e9c7e5f4880befb873abc23862925a6 [2018-12-01 13:22:47,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:22:47,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:22:47,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:22:47,620 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:22:47,620 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:22:47,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2018-12-01 13:22:47,660 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/data/5716bde0d/4818d4d9556d409e93cef716f426fa41/FLAG903cb25f6 [2018-12-01 13:22:48,139 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:22:48,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2018-12-01 13:22:48,146 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/data/5716bde0d/4818d4d9556d409e93cef716f426fa41/FLAG903cb25f6 [2018-12-01 13:22:48,154 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/bin-2019/uautomizer/data/5716bde0d/4818d4d9556d409e93cef716f426fa41 [2018-12-01 13:22:48,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:22:48,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 13:22:48,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:22:48,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:22:48,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:22:48,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48, skipping insertion in model container [2018-12-01 13:22:48,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:22:48,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:22:48,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:22:48,331 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:22:48,389 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:22:48,408 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:22:48,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48 WrapperNode [2018-12-01 13:22:48,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:22:48,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 13:22:48,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 13:22:48,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 13:22:48,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 13:22:48,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:22:48,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:22:48,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:22:48,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... [2018-12-01 13:22:48,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:22:48,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:22:48,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:22:48,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:22:48,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d4f6c6-c961-4286-af23-8a1310da0fcd/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-12-01 13:22:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:22:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 13:22:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:22:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:22:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:22:48,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:22:48,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:22:48,621 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 13:22:48,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:22:48 BoogieIcfgContainer [2018-12-01 13:22:48,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:22:48,622 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 13:22:48,622 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 13:22:48,626 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 13:22:48,626 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:22:48,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 01:22:48" (1/3) ... [2018-12-01 13:22:48,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bc65017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:22:48, skipping insertion in model container [2018-12-01 13:22:48,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:22:48,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:22:48" (2/3) ... [2018-12-01 13:22:48,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bc65017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:22:48, skipping insertion in model container [2018-12-01 13:22:48,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:22:48,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:22:48" (3/3) ... [2018-12-01 13:22:48,630 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-termination.c.i [2018-12-01 13:22:48,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:22:48,667 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 13:22:48,667 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 13:22:48,667 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 13:22:48,667 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:22:48,667 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:22:48,667 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 13:22:48,667 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:22:48,668 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 13:22:48,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-01 13:22:48,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 13:22:48,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:22:48,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:22:48,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 13:22:48,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:22:48,695 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 13:22:48,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-01 13:22:48,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 13:22:48,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:22:48,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:22:48,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 13:22:48,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:22:48,703 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 16#L571-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 12#L553-2true [2018-12-01 13:22:48,704 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 7#L555true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 12#L553-2true [2018-12-01 13:22:48,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-01 13:22:48,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:48,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:48,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-12-01 13:22:48,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:48,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-12-01 13:22:48,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:48,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:49,090 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-12-01 13:22:49,163 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:22:49,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:22:49,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:22:49,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:22:49,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:22:49,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:22:49,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:22:49,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:22:49,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-01 13:22:49,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:22:49,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:22:49,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,390 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-12-01 13:22:49,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:49,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:22:49,829 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:22:49,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:49,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,883 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 13:22:49,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 13:22:49,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:49,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:49,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:49,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:49,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:49,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:49,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:49,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:49,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:49,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:49,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:49,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:22:49,975 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 13:22:49,975 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 13:22:49,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:22:49,977 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 13:22:49,978 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:22:49,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrncpy_~src~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrncpy_~src~0.offset Supporting invariants [] [2018-12-01 13:22:50,005 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-01 13:22:50,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 13:22:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:22:50,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:22:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:22:50,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:22:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:22:50,088 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-12-01 13:22:50,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-12-01 13:22:50,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 6 states. [2018-12-01 13:22:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:22:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:22:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-12-01 13:22:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 13:22:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 13:22:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 13:22:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:50,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2018-12-01 13:22:50,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:22:50,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-12-01 13:22:50,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 13:22:50,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 13:22:50,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-01 13:22:50,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:22:50,143 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-01 13:22:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-01 13:22:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-01 13:22:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 13:22:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-01 13:22:50,159 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 13:22:50,159 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 13:22:50,159 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 13:22:50,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-01 13:22:50,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:22:50,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:22:50,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:22:50,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:22:50,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:22:50,160 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 145#L568 assume !(main_~length~0 < 1); 147#L568-2 assume !(main_~n~0 < 1); 153#L571-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 150#L553-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 151#L555 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 149#L558-3 [2018-12-01 13:22:50,160 INFO L796 eck$LassoCheckResult]: Loop: 149#L558-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 148#L558-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 149#L558-3 [2018-12-01 13:22:50,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-12-01 13:22:50,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-12-01 13:22:50,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:50,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-12-01 13:22:50,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:22:50,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:22:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:22:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:22:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:22:50,519 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 125 [2018-12-01 13:22:50,606 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:22:50,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:22:50,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:22:50,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:22:50,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:22:50,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:22:50,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:22:50,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:22:50,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-01 13:22:50,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:22:50,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:22:50,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,782 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:50,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-12-01 13:22:51,197 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:22:51,197 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:22:51,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:51,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:51,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:51,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:22:51,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:22:51,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:22:51,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 13:22:51,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 13:22:51,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:51,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:22:51,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 13:22:51,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 13:22:51,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:22:51,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 13:22:51,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:22:51,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:22:51,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-01 13:22:51,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:22:51,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:22:51,251 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 13:22:51,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:22:51,259 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-01 13:22:51,259 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 13:22:51,329 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:22:51,390 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-01 13:22:51,390 INFO L444 ModelExtractionUtils]: 67 out of 81 variables were initially zero. Simplification set additionally 11 variables to zero. [2018-12-01 13:22:51,390 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:22:51,391 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-01 13:22:51,391 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:22:51,391 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-12-01 13:22:51,427 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2018-12-01 13:22:51,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 13:22:51,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:22:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:22:51,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:22:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:22:51,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:22:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:22:51,477 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-12-01 13:22:51,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-01 13:22:51,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-12-01 13:22:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:22:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 13:22:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 13:22:51,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 13:22:51,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:51,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 13:22:51,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:51,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-01 13:22:51,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:22:51,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-12-01 13:22:51,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:22:51,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-01 13:22:51,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 13:22:51,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 13:22:51,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 13:22:51,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:22:51,505 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:22:51,505 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:22:51,505 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:22:51,505 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 13:22:51,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 13:22:51,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:22:51,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 13:22:51,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 01:22:51 BoogieIcfgContainer [2018-12-01 13:22:51,510 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 13:22:51,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:22:51,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:22:51,510 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:22:51,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:22:48" (3/4) ... [2018-12-01 13:22:51,512 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 13:22:51,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:22:51,513 INFO L168 Benchmark]: Toolchain (without parser) took 3357.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -212.8 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-12-01 13:22:51,514 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:22:51,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 13:22:51,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.64 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:22:51,515 INFO L168 Benchmark]: Boogie Preprocessor took 15.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:22:51,515 INFO L168 Benchmark]: RCFGBuilder took 172.63 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-01 13:22:51,515 INFO L168 Benchmark]: BuchiAutomizer took 2887.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.9 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. [2018-12-01 13:22:51,515 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:22:51,518 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.64 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.63 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2887.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -57.9 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * src and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 23 SDslu, 12 SDs, 0 SdLazy, 10 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax107 hnf99 lsp90 ukn84 mio100 lsp49 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf116 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 141ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...