./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-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_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/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 65f48e4185e35c19ad63746401273302b721b37d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:16,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:16,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:16,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:16,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:16,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:16,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:16,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:16,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:16,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:16,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:16,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:16,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:16,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:16,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:16,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:16,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:16,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:16,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:16,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:16,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:16,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:16,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:16,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:16,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:16,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:16,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:16,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:16,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:16,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:16,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:16,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:16,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:16,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:16,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:16,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:16,692 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:16,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:16,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:16,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:16,706 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:16,706 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:16,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:16,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:16,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:16,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:16,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:16,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:16,709 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:16,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:16,712 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_4982d63c-2e7d-437b-b594-d52399d680af/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 -> 65f48e4185e35c19ad63746401273302b721b37d [2018-10-27 06:11:16,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:16,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:16,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:16,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:16,752 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:16,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i [2018-10-27 06:11:16,812 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/data/c5e224017/962cd685940545fd93d12fea0fcbf354/FLAGf13f13a4b [2018-10-27 06:11:17,241 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:17,244 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrspn-alloca_true-termination.c.i [2018-10-27 06:11:17,258 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/data/c5e224017/962cd685940545fd93d12fea0fcbf354/FLAGf13f13a4b [2018-10-27 06:11:17,272 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/bin-2019/uautomizer/data/c5e224017/962cd685940545fd93d12fea0fcbf354 [2018-10-27 06:11:17,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:17,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:17,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:17,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:17,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:17,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1d7a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17, skipping insertion in model container [2018-10-27 06:11:17,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:17,324 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:17,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:17,561 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:17,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:17,657 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:17,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17 WrapperNode [2018-10-27 06:11:17,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:17,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:17,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:17,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:17,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:17,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:17,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:17,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:17,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... [2018-10-27 06:11:17,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:17,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:17,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:17,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:17,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4982d63c-2e7d-437b-b594-d52399d680af/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-10-27 06:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:17,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:18,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:18,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:18 BoogieIcfgContainer [2018-10-27 06:11:18,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:18,293 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:18,293 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:18,296 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:18,297 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:18,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:17" (1/3) ... [2018-10-27 06:11:18,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d117a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:18, skipping insertion in model container [2018-10-27 06:11:18,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:18,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:17" (2/3) ... [2018-10-27 06:11:18,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d117a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:18, skipping insertion in model container [2018-10-27 06:11:18,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:18,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:18" (3/3) ... [2018-10-27 06:11:18,300 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-termination.c.i [2018-10-27 06:11:18,345 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:18,346 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:18,346 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:18,346 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:18,346 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:18,346 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:18,346 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:18,347 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:18,347 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:18,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:11:18,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:18,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:18,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:18,387 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:18,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:18,388 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:18,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:11:18,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:18,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:18,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:18,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:18,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:18,396 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L562true assume !(main_~length1~0 < 1); 20#L562-2true assume !(main_~length2~0 < 1); 9#L565-1true #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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 23#L570true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 4#L570-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 19#L571true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 6#L556true [2018-10-27 06:11:18,396 INFO L795 eck$LassoCheckResult]: Loop: 6#L556true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 10#L553true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 13#L553-1true cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 22#L554-5true assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 11#L554-1true SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 14#L554-2true cstrspn_~sc~0 := cstrspn_#t~mem5; 16#L554-3true assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 7#L555true assume cstrspn_~sc~0 == cstrspn_~c~0; 6#L556true [2018-10-27 06:11:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:11:18,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:18,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash 801407178, now seen corresponding path program 1 times [2018-10-27 06:11:18,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:18,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:18,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:18,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744052, now seen corresponding path program 1 times [2018-10-27 06:11:18,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:18,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:18,844 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:11:19,019 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 06:11:19,635 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:11:19,980 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:11:19,994 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:19,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:19,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:19,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:19,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:19,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:19,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:19,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:19,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:11:19,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:19,997 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:20,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,539 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-10-27 06:11:20,743 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-27 06:11:20,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:20,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:21,091 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:11:21,438 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:21,442 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:21,444 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-10-27 06:11:21,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,452 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-10-27 06:11:21,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,455 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-10-27 06:11:21,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,458 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-10-27 06:11:21,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,461 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-10-27 06:11:21,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,468 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-10-27 06:11:21,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,477 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-10-27 06:11:21,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,480 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-10-27 06:11:21,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,486 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-10-27 06:11:21,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,489 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-10-27 06:11:21,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,498 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-10-27 06:11:21,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:21,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,502 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-10-27 06:11:21,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:21,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:11:21,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:11:21,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:21,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,517 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-10-27 06:11:21,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,534 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-10-27 06:11:21,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,542 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-10-27 06:11:21,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:21,551 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-10-27 06:11:21,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:21,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:21,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:21,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:21,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:21,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:21,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:21,665 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:21,665 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:21,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:21,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:21,669 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:21,670 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrspn_~p~0.offset Supporting invariants [] [2018-10-27 06:11:21,828 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:11:21,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:21,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:21,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:21,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:22,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:11:22,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-10-27 06:11:22,171 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 5 states. Result 38 states and 42 transitions. Complement of second has 9 states. [2018-10-27 06:11:22,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-10-27 06:11:22,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2018-10-27 06:11:22,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:22,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 16 letters. Loop has 8 letters. [2018-10-27 06:11:22,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:22,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 16 letters. [2018-10-27 06:11:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:22,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2018-10-27 06:11:22,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:22,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 23 states and 27 transitions. [2018-10-27 06:11:22,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:22,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:11:22,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:11:22,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:22,185 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:11:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-27 06:11:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:11:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-10-27 06:11:22,207 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:11:22,207 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:11:22,207 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:22,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-10-27 06:11:22,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:22,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:22,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:22,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:22,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:22,208 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 214#L562 assume !(main_~length1~0 < 1); 225#L562-2 assume !(main_~length2~0 < 1); 215#L565-1 #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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 216#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 204#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 205#L571 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 206#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 207#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 217#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 210#L554-5 [2018-10-27 06:11:22,209 INFO L795 eck$LassoCheckResult]: Loop: 210#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 218#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 219#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 223#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 209#L555 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 210#L554-5 [2018-10-27 06:11:22,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2052449962, now seen corresponding path program 1 times [2018-10-27 06:11:22,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 1 times [2018-10-27 06:11:22,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744054, now seen corresponding path program 1 times [2018-10-27 06:11:22,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:22,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:22,703 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2018-10-27 06:11:22,851 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-10-27 06:11:22,853 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:22,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:22,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:22,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:22,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:22,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:22,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:22,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:22,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:11:22,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:22,854 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:22,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:22,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:23,320 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-10-27 06:11:23,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:23,967 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:23,967 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:23,968 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-10-27 06:11:23,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,973 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-10-27 06:11:23,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,975 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-10-27 06:11:23,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,982 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-10-27 06:11:23,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,984 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-10-27 06:11:23,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,991 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-10-27 06:11:23,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:23,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:23,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,997 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-10-27 06:11:23,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:23,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:23,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:23,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:23,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:23,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:23,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:23,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:23,999 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-10-27 06:11:23,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,008 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-10-27 06:11:24,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:24,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,013 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-10-27 06:11:24,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:24,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,015 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-10-27 06:11:24,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,023 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-10-27 06:11:24,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,029 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-10-27 06:11:24,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,032 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-10-27 06:11:24,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:24,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,039 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-10-27 06:11:24,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:24,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:24,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:24,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,041 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-10-27 06:11:24,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,050 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-10-27 06:11:24,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,065 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-10-27 06:11:24,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,069 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-10-27 06:11:24,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,079 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-10-27 06:11:24,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:24,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,091 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-10-27 06:11:24,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:24,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:24,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,106 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-10-27 06:11:24,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,113 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-10-27 06:11:24,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,113 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-10-27 06:11:24,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,125 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-10-27 06:11:24,125 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-10-27 06:11:24,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,169 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-10-27 06:11:24,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,176 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-10-27 06:11:24,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,177 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:24,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,179 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:24,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:24,189 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-10-27 06:11:24,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:24,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:24,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:24,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:24,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:24,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:24,207 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:24,220 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:24,220 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:24,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:24,222 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:24,223 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:24,223 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2018-10-27 06:11:24,622 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-10-27 06:11:24,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:24,647 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:24,647 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:24,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:24,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:24,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:25,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:25,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-10-27 06:11:25,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-10-27 06:11:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:11:25,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-10-27 06:11:25,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 16 letters. Loop has 5 letters. [2018-10-27 06:11:25,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 10 letters. [2018-10-27 06:11:25,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:25,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-10-27 06:11:25,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:25,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 35 states and 41 transitions. [2018-10-27 06:11:25,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:25,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:11:25,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-10-27 06:11:25,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:25,291 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-27 06:11:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-10-27 06:11:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-10-27 06:11:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 06:11:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-10-27 06:11:25,295 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-10-27 06:11:25,295 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-10-27 06:11:25,295 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:25,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-10-27 06:11:25,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:25,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:25,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:25,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:25,297 INFO L793 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 429#L562 assume !(main_~length1~0 < 1); 442#L562-2 assume !(main_~length2~0 < 1); 430#L565-1 #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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.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~malloc9.base, main_#t~malloc9.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~malloc9.base, main_#t~malloc9.offset; 431#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 418#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 419#L571 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 420#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 421#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 438#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 427#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 435#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 436#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 447#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 445#L555 assume cstrspn_~sc~0 == cstrspn_~c~0; 422#L556 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 423#L553 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L553 432#L553-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 425#L554-5 [2018-10-27 06:11:25,297 INFO L795 eck$LassoCheckResult]: Loop: 425#L554-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 433#L554-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L554-1 434#L554-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 439#L554-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 424#L555 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 425#L554-5 [2018-10-27 06:11:25,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1722691775, now seen corresponding path program 2 times [2018-10-27 06:11:25,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:25,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 2 times [2018-10-27 06:11:25,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1021159359, now seen corresponding path program 1 times [2018-10-27 06:11:25,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:25,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:25,686 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:11:25,918 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:11:26,627 WARN L179 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 150 [2018-10-27 06:11:26,754 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-27 06:11:26,756 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:26,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:26,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:26,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:26,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:26,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:26,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:26,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:26,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:11:26,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:26,756 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:26,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:26,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:26,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,129 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2018-10-27 06:11:27,255 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-10-27 06:11:27,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:27,736 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:27,736 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:27,736 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-10-27 06:11:27,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:27,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:27,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:27,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:27,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:27,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:27,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:27,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:27,743 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-10-27 06:11:27,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:27,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:27,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:27,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:27,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:27,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:27,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:27,746 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-10-27 06:11:27,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:27,750 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:27,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:27,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:27,752 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:27,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:27,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:27,762 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-10-27 06:11:27,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:27,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:27,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:27,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:27,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:27,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:27,780 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:27,792 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:27,792 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:27,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:27,793 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:27,793 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:27,793 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2018-10-27 06:11:28,087 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-10-27 06:11:28,089 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:28,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:28,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:11:28,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:11:28,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 44 states and 51 transitions. Complement of second has 8 states. [2018-10-27 06:11:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-10-27 06:11:28,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:11:28,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:28,265 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:28,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:28,345 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:11:28,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:11:28,419 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 10 states. [2018-10-27 06:11:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-10-27 06:11:28,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:11:28,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:28,421 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:28,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:28,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:28,500 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:11:28,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:11:28,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2018-10-27 06:11:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-10-27 06:11:28,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:11:28,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:28,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 24 letters. Loop has 5 letters. [2018-10-27 06:11:28,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:28,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 10 letters. [2018-10-27 06:11:28,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:28,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-10-27 06:11:28,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:28,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2018-10-27 06:11:28,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:28,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:28,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:28,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:28,547 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:28,548 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:28,548 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:28,548 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:28,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:28,548 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:28,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:28,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:28 BoogieIcfgContainer [2018-10-27 06:11:28,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:28,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:28,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:28,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:28,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:18" (3/4) ... [2018-10-27 06:11:28,561 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:28,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:28,562 INFO L168 Benchmark]: Toolchain (without parser) took 11285.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 957.7 MB in the beginning and 935.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,563 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:28,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,564 INFO L168 Benchmark]: Boogie Preprocessor took 40.77 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,564 INFO L168 Benchmark]: RCFGBuilder took 474.16 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,565 INFO L168 Benchmark]: BuchiAutomizer took 10262.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 191.8 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:28,565 INFO L168 Benchmark]: Witness Printer took 5.75 ms. Allocated memory is still 1.2 GB. Free memory is still 935.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:28,572 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.47 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.77 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 474.16 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10262.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 191.8 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.75 ms. Allocated memory is still 1.2 GB. Free memory is still 935.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * spanp and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * spanp and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 91 SDtfs, 123 SDslu, 77 SDs, 0 SdLazy, 72 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax107 hnf99 lsp89 ukn102 mio100 lsp33 div100 bol100 ite100 ukn100 eq195 hnf88 smp96 dnf100 smp100 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...