./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/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 217963df20137e939d67fe2243ee5b5bf7e9133e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:12:32,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:12:32,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:12:32,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:12:32,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:12:32,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:12:32,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:12:32,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:12:32,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:12:32,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:12:32,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:12:32,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:12:32,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:12:32,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:12:32,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:12:32,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:12:32,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:12:32,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:12:32,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:12:32,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:12:32,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:12:32,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:12:32,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:12:32,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:12:32,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:12:32,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:12:32,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:12:32,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:12:32,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:12:32,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:12:32,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:12:32,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:12:32,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:12:32,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:12:32,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:12:32,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:12:32,692 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 00:12:32,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:12:32,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:12:32,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:12:32,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:12:32,704 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:12:32,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:12:32,704 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:12:32,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:12:32,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:12:32,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:12:32,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:12:32,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:12:32,707 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:12:32,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:12:32,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:12:32,707 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:12:32,708 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:12:32,708 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_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/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 -> 217963df20137e939d67fe2243ee5b5bf7e9133e [2018-11-10 00:12:32,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:12:32,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:12:32,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:12:32,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:12:32,743 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:12:32,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i [2018-11-10 00:12:32,783 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/data/d48a84e94/91ee6e1cf0e04b4994575b3eef11fcb0/FLAG4073e8482 [2018-11-10 00:12:33,220 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:12:33,221 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/sv-benchmarks/c/termination-15/cstrncat_reverse_alloca_true-termination.c.i [2018-11-10 00:12:33,228 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/data/d48a84e94/91ee6e1cf0e04b4994575b3eef11fcb0/FLAG4073e8482 [2018-11-10 00:12:33,238 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/data/d48a84e94/91ee6e1cf0e04b4994575b3eef11fcb0 [2018-11-10 00:12:33,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:12:33,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:12:33,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:12:33,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:12:33,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:12:33,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a61c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33, skipping insertion in model container [2018-11-10 00:12:33,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:12:33,285 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:12:33,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:12:33,495 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:12:33,526 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:12:33,569 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:12:33,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33 WrapperNode [2018-11-10 00:12:33,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:12:33,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:12:33,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:12:33,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:12:33,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:12:33,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:12:33,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:12:33,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:12:33,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... [2018-11-10 00:12:33,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:12:33,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:12:33,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:12:33,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:12:33,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a158c3f-7702-4bdd-abcf-1eb840e2bb5e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:12:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:12:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:12:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:12:33,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:12:33,868 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:12:33,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:12:33 BoogieIcfgContainer [2018-11-10 00:12:33,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:12:33,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:12:33,869 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:12:33,872 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:12:33,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:12:33,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:12:33" (1/3) ... [2018-11-10 00:12:33,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65e95809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:12:33, skipping insertion in model container [2018-11-10 00:12:33,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:12:33,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:12:33" (2/3) ... [2018-11-10 00:12:33,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65e95809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:12:33, skipping insertion in model container [2018-11-10 00:12:33,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:12:33,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:12:33" (3/3) ... [2018-11-10 00:12:33,876 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_reverse_alloca_true-termination.c.i [2018-11-10 00:12:33,913 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:12:33,914 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:12:33,914 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:12:33,914 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:12:33,914 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:12:33,914 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:12:33,914 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:12:33,914 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:12:33,914 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:12:33,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 00:12:33,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:12:33,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:12:33,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:12:33,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:12:33,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 00:12:33,945 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:12:33,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 00:12:33,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:12:33,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:12:33,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:12:33,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:12:33,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 00:12:33,952 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 28#L381true assume !(main_~length1~0 < 1); 29#L381-2true assume !(main_~length2~0 < 1); 24#L384-1true assume !(main_~n~0 < 1); 8#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset; 15#L393true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L393 16#L393-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L393-1 12#L394true main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 10#L367-4true [2018-11-10 00:12:33,952 INFO L795 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 4#L367-1true SUMMARY for call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L367-1 6#L367-2true assume !!(cstrncat_#t~mem205 != 0);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, cstrncat_#t~post206.offset - 1;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 10#L367-4true [2018-11-10 00:12:33,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 00:12:33,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:12:33,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:12:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:33,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:12:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 00:12:34,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:12:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:12:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:12:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 00:12:34,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:12:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:12:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:34,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:12:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:12:34,470 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2018-11-10 00:12:34,582 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 00:12:34,592 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:12:34,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:12:34,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:12:34,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:12:34,593 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:12:34,593 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:12:34,593 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:12:34,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:12:34,593 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 00:12:34,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:12:34,594 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:12:34,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-11-10 00:12:34,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,877 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-10 00:12:34,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:34,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:12:35,287 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:12:35,290 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:12:35,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:12:35,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:12:35,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:12:35,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:12:35,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:12:35,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:12:35,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:12:35,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:12:35,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,356 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:12:35,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:12:35,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:12:35,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:12:35,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:12:35,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:12:35,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:12:35,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:12:35,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:12:35,419 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:12:35,435 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:12:35,435 INFO L444 ModelExtractionUtils]: 64 out of 67 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 00:12:35,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:12:35,439 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:12:35,439 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:12:35,440 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0.offset) = 2*ULTIMATE.start_cstrncat_~s~0.offset + 1 Supporting invariants [] [2018-11-10 00:12:35,479 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 00:12:35,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:12:35,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:12:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:12:35,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:12:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:12:35,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 00:12:35,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2018-11-10 00:12:35,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 79 states and 101 transitions. Complement of second has 7 states. [2018-11-10 00:12:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 00:12:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 00:12:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-10 00:12:35,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 00:12:35,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:12:35,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 00:12:35,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:12:35,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 00:12:35,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:12:35,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 101 transitions. [2018-11-10 00:12:35,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:12:35,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 32 states and 39 transitions. [2018-11-10 00:12:35,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 00:12:35,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 00:12:35,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-10 00:12:35,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:12:35,596 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 00:12:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-10 00:12:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-10 00:12:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 00:12:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-10 00:12:35,613 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 00:12:35,613 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 00:12:35,614 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:12:35,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-10 00:12:35,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:12:35,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:12:35,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:12:35,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:12:35,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:12:35,615 INFO L793 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 222#L381 assume !(main_~length1~0 < 1); 227#L381-2 assume !(main_~length2~0 < 1); 220#L384-1 assume !(main_~n~0 < 1); 212#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset; 213#L393 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L393 225#L393-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L393-1 219#L394 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 214#L367-4 assume true; 207#L367-1 SUMMARY for call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L367-1 208#L367-2 assume !(cstrncat_#t~mem205 != 0);havoc cstrncat_#t~mem205; 209#L369-8 assume true; 229#L369 cstrncat_#t~short209 := cstrncat_~n != 0; 230#L369-1 assume !cstrncat_#t~short209; 211#L369-6 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 233#L369-8 assume true; 223#L369 [2018-11-10 00:12:35,615 INFO L795 eck$LassoCheckResult]: Loop: 223#L369 cstrncat_#t~short209 := cstrncat_~n != 0; 228#L369-1 assume !cstrncat_#t~short209; 215#L369-6 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 216#L369-8 assume true; 223#L369 [2018-11-10 00:12:35,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1206762798, now seen corresponding path program 1 times [2018-11-10 00:12:35,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:12:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:12:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:12:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:12:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:12:35,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:12:35,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:12:35,666 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:12:35,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:12:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2378489, now seen corresponding path program 1 times [2018-11-10 00:12:35,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:12:35,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:12:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:35,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:12:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:12:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:12:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:12:35,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:12:35,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:12:35,699 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:12:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:12:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:12:35,703 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 00:12:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:12:35,714 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-10 00:12:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:12:35,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-10 00:12:35,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:12:35,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-10 00:12:35,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:12:35,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:12:35,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:12:35,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:12:35,717 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:12:35,717 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:12:35,717 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:12:35,718 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:12:35,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:12:35,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:12:35,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:12:35,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:12:35 BoogieIcfgContainer [2018-11-10 00:12:35,722 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:12:35,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:12:35,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:12:35,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:12:35,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:12:33" (3/4) ... [2018-11-10 00:12:35,726 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:12:35,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:12:35,727 INFO L168 Benchmark]: Toolchain (without parser) took 2485.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 975.6 MB in the end (delta: -19.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 11.5 GB. [2018-11-10 00:12:35,727 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:12:35,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:12:35,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:12:35,729 INFO L168 Benchmark]: Boogie Preprocessor took 14.66 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-11-10 00:12:35,729 INFO L168 Benchmark]: RCFGBuilder took 209.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:12:35,730 INFO L168 Benchmark]: BuchiAutomizer took 1853.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.6 MB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:12:35,730 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 975.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:12:35,733 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.66 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 209.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1853.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.6 MB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 975.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 54 SDtfs, 38 SDslu, 40 SDs, 0 SdLazy, 17 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital200 mio100 ax100 hnf98 lsp96 ukn100 mio100 lsp54 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...