./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/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 2f11210fb32f4d3c697b29c6d0c40652627e6e63 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:07:40,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:40,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:40,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:40,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:40,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:40,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:40,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:40,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:40,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:40,422 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:40,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:40,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:40,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:40,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:40,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:40,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:40,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:40,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:40,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:40,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:40,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:40,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:40,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:40,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:40,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:40,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:40,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:40,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:40,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:40,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:40,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:40,440 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:40,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:40,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:40,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:40,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:40,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:40,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:40,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:40,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:40,457 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:40,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:40,457 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:40,458 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:40,458 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:40,458 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:40,458 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:40,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:40,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:40,460 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:40,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:40,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:40,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:40,460 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:40,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:40,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:40,461 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:40,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:40,464 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_b80453c9-4167-4bf2-a54a-8ed1cc650546/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 -> 2f11210fb32f4d3c697b29c6d0c40652627e6e63 [2018-10-27 06:07:40,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:40,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:40,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:40,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:40,510 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:40,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-10-27 06:07:40,560 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/data/38fd002b6/4707c0851dc74dfa977bf0ba05dc21b5/FLAG952d538c2 [2018-10-27 06:07:40,977 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:40,978 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-10-27 06:07:40,986 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/data/38fd002b6/4707c0851dc74dfa977bf0ba05dc21b5/FLAG952d538c2 [2018-10-27 06:07:40,998 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/bin-2019/uautomizer/data/38fd002b6/4707c0851dc74dfa977bf0ba05dc21b5 [2018-10-27 06:07:41,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:41,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:41,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:41,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:41,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:41,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b298a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41, skipping insertion in model container [2018-10-27 06:07:41,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:41,049 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:41,287 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:41,296 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:41,347 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:41,391 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:41,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41 WrapperNode [2018-10-27 06:07:41,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:41,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:41,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:41,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:41,400 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:07:41" (1/1) ... [2018-10-27 06:07:41,415 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:07:41" (1/1) ... [2018-10-27 06:07:41,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:41,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:41,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:41,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:41,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... [2018-10-27 06:07:41,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:41,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:41,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:41,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:41,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b80453c9-4167-4bf2-a54a-8ed1cc650546/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:07:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:41,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:42,110 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:42,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:42 BoogieIcfgContainer [2018-10-27 06:07:42,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:42,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:42,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:42,113 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:42,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:42,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:40" (1/3) ... [2018-10-27 06:07:42,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7936cc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:42, skipping insertion in model container [2018-10-27 06:07:42,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:42,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:41" (2/3) ... [2018-10-27 06:07:42,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7936cc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:42, skipping insertion in model container [2018-10-27 06:07:42,116 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:42,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:42" (3/3) ... [2018-10-27 06:07:42,117 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_reverse_alloca_true-termination.c.i [2018-10-27 06:07:42,166 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:42,166 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:42,167 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:42,167 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:42,167 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:42,167 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:42,167 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:42,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:42,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:42,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:07:42,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:42,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:42,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:42,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,207 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:42,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:07:42,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:42,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:42,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:42,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,216 INFO L793 eck$LassoCheckResult]: Stem: 23#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~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 9#L382true assume !(main_~length1~0 < 1); 13#L382-2true assume !(main_~length2~0 < 1); 7#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 12#L391true main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L369-5true [2018-10-27 06:07:42,217 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 15#L369-1true SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 17#L369-2true assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 10#L371true SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 11#L371-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 3#L369-4true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 4#L369-5true [2018-10-27 06:07:42,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:07:42,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:42,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:07:42,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:42,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:42,409 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:07:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:42,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:42,415 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:07:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:07:42,432 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:07:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:42,440 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:07:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:07:42,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:07:42,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:42,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:07:42,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:07:42,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:07:42,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:07:42,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:42,450 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:07:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:07:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:07:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:07:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:07:42,476 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:07:42,477 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:07:42,477 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:42,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:07:42,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:42,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:42,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:42,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:42,480 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 82#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 68#L369-5 [2018-10-27 06:07:42,480 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 78#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 81#L372-3 assume !cstrpbrk_#t~short210; 64#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 65#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 67#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 68#L369-5 [2018-10-27 06:07:42,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:07:42,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:42,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:07:42,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:42,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:42,934 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:07:42,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:42,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:07:42,934 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:42,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:42,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:42,935 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:07:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:43,363 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:07:43,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:07:43,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:07:43,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:43,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-10-27 06:07:43,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:07:43,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:07:43,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-10-27 06:07:43,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:43,368 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-27 06:07:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-10-27 06:07:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-27 06:07:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:07:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 06:07:43,371 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:07:43,371 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:07:43,371 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:43,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-10-27 06:07:43,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:43,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:43,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:43,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:43,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:43,373 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 167#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 152#L369-5 [2018-10-27 06:07:43,373 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 162#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 166#L372-3 assume cstrpbrk_#t~short210; 168#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 172#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 158#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 151#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 152#L369-5 [2018-10-27 06:07:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:07:43,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-10-27 06:07:43,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-10-27 06:07:43,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:43,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:43,916 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-10-27 06:07:44,113 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-10-27 06:07:44,400 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-10-27 06:07:44,503 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:44,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:44,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:44,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:44,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:44,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:44,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:44,505 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:44,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:07:44,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:44,505 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:44,525 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:07:44,536 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:07:44,538 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:07:44,854 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-10-27 06:07:45,008 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-27 06:07:45,009 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:07:45,012 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:07:45,013 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:07:45,014 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:07:45,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:07:45,030 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:07:45,032 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:07:45,033 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:07:45,035 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:07:45,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:07:45,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:07:45,039 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:07:45,045 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:07:45,046 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:07:45,047 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:07:45,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:07:45,051 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:07:45,211 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 06:07:45,616 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:45,621 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:45,623 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:07:45,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:45,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:45,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:45,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,629 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:07:45,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:45,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:45,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:45,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,631 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:07:45,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,631 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:45,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,636 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:45,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,654 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:07:45,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:45,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,659 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:07:45,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:45,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,665 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:07:45,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:45,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:45,670 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:07:45,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:45,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:45,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:45,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:45,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,793 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:45,818 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:07:45,819 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:07:45,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:45,822 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:45,822 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:45,823 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 2*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1 Supporting invariants [] [2018-10-27 06:07:45,927 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:07:45,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:45,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:46,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:46,016 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:07:46,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:07:46,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:07:46,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 40 states and 47 transitions. Complement of second has 6 states. [2018-10-27 06:07:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:07:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:07:46,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-10-27 06:07:46,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:46,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-10-27 06:07:46,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:46,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-10-27 06:07:46,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:46,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-10-27 06:07:46,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:07:46,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-10-27 06:07:46,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:07:46,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:07:46,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-10-27 06:07:46,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:46,066 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 06:07:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-10-27 06:07:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-27 06:07:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:07:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-27 06:07:46,068 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:07:46,068 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:07:46,068 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:46,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-10-27 06:07:46,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:46,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:46,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:46,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:46,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:46,070 INFO L793 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 357#L382 assume !(main_~length1~0 < 1); 358#L382-2 assume !(main_~length2~0 < 1); 353#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 354#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 371#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 368#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 347#L369-5 assume true; 349#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 374#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 362#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 363#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 342#L372-9 [2018-10-27 06:07:46,070 INFO L795 eck$LassoCheckResult]: Loop: 342#L372-9 assume true; 351#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 359#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 366#L372-3 assume !cstrpbrk_#t~short210; 341#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 342#L372-9 [2018-10-27 06:07:46,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:07:46,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:07:46,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:46,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:46,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:46,137 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:07:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:46,138 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:46,138 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:07:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:46,146 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-10-27 06:07:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:46,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-10-27 06:07:46,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:46,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-10-27 06:07:46,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:07:46,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:07:46,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-10-27 06:07:46,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:46,149 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:07:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-10-27 06:07:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:07:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:07:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:07:46,151 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:07:46,151 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:07:46,151 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:46,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:07:46,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:46,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:46,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:46,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:46,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:46,152 INFO L793 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 436#L382 assume !(main_~length1~0 < 1); 437#L382-2 assume !(main_~length2~0 < 1); 433#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 434#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 450#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 447#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 427#L369-5 assume true; 429#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 451#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 438#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 439#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 421#L372-9 [2018-10-27 06:07:46,152 INFO L795 eck$LassoCheckResult]: Loop: 421#L372-9 assume true; 431#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 442#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 445#L372-3 assume cstrpbrk_#t~short210; 448#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 453#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 420#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 421#L372-9 [2018-10-27 06:07:46,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:07:46,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:07:46,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:46,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:46,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:46,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:07:46,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:46,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:46,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:46,696 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-10-27 06:07:46,910 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-10-27 06:07:46,911 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:46,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:46,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:46,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:46,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:46,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:46,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:46,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:46,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:07:46,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:46,912 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:46,916 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:07:46,920 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:07:46,921 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:07:46,930 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:07:46,932 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:07:46,933 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:07:46,935 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:07:46,936 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:07:46,938 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:07:46,939 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:07:46,941 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:07:46,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,944 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:07:46,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,947 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:07:46,948 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:07:46,950 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:07:46,951 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:07:47,207 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2018-10-27 06:07:47,379 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-10-27 06:07:47,379 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:07:47,381 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:07:47,910 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:07:47,925 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:47,925 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:47,926 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:07:47,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,928 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:07:47,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,936 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:07:47,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:47,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:47,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,939 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:07:47,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,946 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:07:47,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,948 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:07:47,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,954 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:07:47,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:47,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:47,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,969 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:07:47,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,971 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:07:47,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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:07:47,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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:07:47,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,988 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:07:47,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,990 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:07:47,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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:07:47,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,000 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:07:48,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:48,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:48,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:48,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,005 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:07:48,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:48,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:48,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:48,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,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:07:48,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:48,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:48,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:48,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:48,059 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:07:48,060 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:07:48,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:48,061 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:48,061 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:48,061 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 Supporting invariants [] [2018-10-27 06:07:48,499 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:07:48,574 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:07:48,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:48,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:48,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:48,750 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:07:48,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:07:48,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:07:48,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-10-27 06:07:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:07:48,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:07:48,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:48,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:07:48,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:48,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:07:48,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:48,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-10-27 06:07:48,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:48,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-10-27 06:07:48,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:07:48,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:07:48,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-10-27 06:07:48,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:48,814 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-27 06:07:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-10-27 06:07:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-10-27 06:07:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:07:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:07:48,817 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:07:48,817 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:07:48,817 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:48,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:07:48,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:48,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:48,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:48,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:48,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:48,819 INFO L793 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 725#L382 assume !(main_~length1~0 < 1); 726#L382-2 assume !(main_~length2~0 < 1); 722#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 723#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 739#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 736#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 713#L369-5 assume true; 714#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 744#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 729#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 730#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 719#L372-9 assume true; 721#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 732#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 735#L372-3 assume cstrpbrk_#t~short210; 738#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 741#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 709#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 710#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 717#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 711#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 712#L369-5 assume true; 716#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 742#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 727#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 728#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 708#L372-9 [2018-10-27 06:07:48,819 INFO L795 eck$LassoCheckResult]: Loop: 708#L372-9 assume true; 718#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 731#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 734#L372-3 assume cstrpbrk_#t~short210; 737#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 740#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 707#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 708#L372-9 [2018-10-27 06:07:48,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-10-27 06:07:48,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:48,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:07:48,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:07:48,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:48,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,366 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-27 06:07:49,936 WARN L179 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 155 [2018-10-27 06:07:50,623 WARN L179 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2018-10-27 06:07:50,625 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:50,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:50,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:50,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:50,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:50,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:50,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:50,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:50,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:07:50,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:50,626 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:50,633 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:07:50,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,648 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:07:50,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,653 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:07:50,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,663 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:07:50,665 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:07:50,666 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:07:50,667 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:07:50,669 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:07:51,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:07:51,682 WARN L179 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2018-10-27 06:07:51,844 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-10-27 06:07:51,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:51,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:51,847 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:07:51,848 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:07:51,858 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:07:51,859 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:07:51,860 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:07:51,861 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:07:51,862 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:07:52,060 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-27 06:07:52,650 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-10-27 06:07:52,751 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:07:52,766 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:52,766 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:52,766 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:07:52,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,768 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:07:52,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,774 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:07:52,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,775 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:07:52,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,784 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:07:52,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,785 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:07:52,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,787 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:07:52,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,799 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:07:52,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,801 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:07:52,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,803 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:07:52,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:52,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:52,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:52,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,805 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:07:52,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,820 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:07:52,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,823 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:07:52,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,828 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:07:52,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:52,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,842 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:52,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,843 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:52,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,855 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:07:52,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,856 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:52,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,860 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:52,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:52,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:52,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:52,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:52,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:52,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:52,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:52,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:52,894 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:52,915 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:07:52,916 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:07:52,916 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:52,917 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:52,917 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:52,917 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 + 2*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-10-27 06:07:53,554 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2018-10-27 06:07:53,555 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:07:53,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,636 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:07:53,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-10-27 06:07:53,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:07:53,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 80 states and 86 transitions. Complement of second has 8 states. [2018-10-27 06:07:53,693 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:07:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:07:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-10-27 06:07:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:07:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,694 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:53,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,762 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:07:53,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-10-27 06:07:53,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:07:53,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 80 states and 86 transitions. Complement of second has 8 states. [2018-10-27 06:07:53,790 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:07:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:07:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-10-27 06:07:53,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:07:53,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:53,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:53,882 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:07:53,882 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 2 loop predicates [2018-10-27 06:07:53,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-10-27 06:07:53,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 85 states and 92 transitions. Complement of second has 7 states. [2018-10-27 06:07:53,927 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:07:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:07:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-10-27 06:07:53,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:07:53,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:07:53,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:07:53,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:53,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:07:53,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:53,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:07:53,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:53,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:53,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:53,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:53,932 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:53,932 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:53,932 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:53,932 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:53,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:53,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:53,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:53,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:53 BoogieIcfgContainer [2018-10-27 06:07:53,942 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:53,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:53,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:53,943 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:53,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:42" (3/4) ... [2018-10-27 06:07:53,946 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:53,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:53,947 INFO L168 Benchmark]: Toolchain (without parser) took 12945.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 955.8 MB in the beginning and 1.2 GB in the end (delta: -204.0 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:53,948 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:53,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.81 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:53,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -220.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:53,949 INFO L168 Benchmark]: Boogie Preprocessor took 32.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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:53,950 INFO L168 Benchmark]: RCFGBuilder took 577.54 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:07:53,950 INFO L168 Benchmark]: BuchiAutomizer took 11831.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.9 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:53,951 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:53,959 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.81 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -220.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 577.54 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 11831.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.9 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * s + unknown-#length-unknown[nondetString2] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + 2 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 199 SDtfs, 207 SDslu, 196 SDs, 0 SdLazy, 187 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp92 ukn86 mio100 lsp37 div115 bol100 ite100 ukn100 eq186 hnf82 smp92 dnf544 smp33 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...