./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtok_r_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_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/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 1697f909ede7c89de56057e54b84d7ae7cf0bcac .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:14:36,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:14:36,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:14:36,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:14:36,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:14:36,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:14:36,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:14:36,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:14:36,539 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:14:36,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:14:36,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:14:36,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:14:36,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:14:36,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:14:36,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:14:36,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:14:36,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:14:36,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:14:36,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:14:36,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:14:36,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:14:36,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:14:36,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:14:36,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:14:36,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:14:36,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:14:36,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:14:36,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:14:36,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:14:36,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:14:36,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:14:36,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:14:36,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:14:36,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:14:36,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:14:36,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:14:36,552 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:14:36,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:14:36,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:14:36,564 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:14:36,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:14:36,564 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:14:36,565 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:14:36,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:14:36,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:14:36,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:14:36,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:14:36,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:14:36,567 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:14:36,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:14:36,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:14:36,567 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:14:36,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:14:36,568 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_6621a70d-701f-4e6e-9cd9-374b4c24ae29/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 -> 1697f909ede7c89de56057e54b84d7ae7cf0bcac [2018-11-10 12:14:36,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:14:36,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:14:36,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:14:36,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:14:36,602 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:14:36,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-10 12:14:36,647 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/data/9a740f89f/6ce3a01b7c3a4f109c720da414707652/FLAG7b4e5b813 [2018-11-10 12:14:37,094 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:14:37,095 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-10 12:14:37,104 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/data/9a740f89f/6ce3a01b7c3a4f109c720da414707652/FLAG7b4e5b813 [2018-11-10 12:14:37,116 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/data/9a740f89f/6ce3a01b7c3a4f109c720da414707652 [2018-11-10 12:14:37,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:14:37,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:14:37,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:14:37,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:14:37,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:14:37,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37, skipping insertion in model container [2018-11-10 12:14:37,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:14:37,162 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:14:37,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:14:37,372 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:14:37,397 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:14:37,430 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:14:37,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37 WrapperNode [2018-11-10 12:14:37,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:14:37,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:14:37,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:14:37,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:14:37,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:14:37,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:14:37,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:14:37,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:14:37,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... [2018-11-10 12:14:37,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:14:37,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:14:37,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:14:37,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:14:37,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:37,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:14:37,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:14:37,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:14:37,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:14:37,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:14:37,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:14:37,895 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:14:37,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:37 BoogieIcfgContainer [2018-11-10 12:14:37,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:14:37,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:14:37,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:14:37,898 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:14:37,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:37,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:14:37" (1/3) ... [2018-11-10 12:14:37,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8e8905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:14:37, skipping insertion in model container [2018-11-10 12:14:37,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:37,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:37" (2/3) ... [2018-11-10 12:14:37,900 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8e8905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:14:37, skipping insertion in model container [2018-11-10 12:14:37,900 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:37,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:37" (3/3) ... [2018-11-10 12:14:37,901 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-11-10 12:14:37,934 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:14:37,934 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:14:37,934 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:14:37,934 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:14:37,935 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:14:37,935 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:14:37,935 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:14:37,935 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:14:37,935 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:14:37,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 12:14:37,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 12:14:37,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:37,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:37,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:37,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:37,966 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:14:37,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 12:14:37,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 12:14:37,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:37,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:37,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:37,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:37,974 INFO L793 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 8#L544true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 27#L546true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 28#L546-1true main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3#L548true assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 38#L550true SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 42#L550-1true assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 31#L532true assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 40#L532-4true assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 25#L510-5true [2018-11-10 12:14:37,975 INFO L795 eck$LassoCheckResult]: Loop: 25#L510-5true assume true; 35#L510-1true SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 37#L510-2true assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 32#L511-11true assume !true; 34#L511-12true SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 18#L512true assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 44#L510-4true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 25#L510-5true [2018-11-10 12:14:37,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1273994252, now seen corresponding path program 1 times [2018-11-10 12:14:37,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1691337819, now seen corresponding path program 1 times [2018-11-10 12:14:38,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:38,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:14:38,114 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:14:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:14:38,125 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-10 12:14:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:38,131 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-10 12:14:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:14:38,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2018-11-10 12:14:38,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 12:14:38,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 43 states and 49 transitions. [2018-11-10 12:14:38,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 12:14:38,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 12:14:38,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2018-11-10 12:14:38,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:38,146 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 12:14:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2018-11-10 12:14:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 12:14:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 12:14:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-10 12:14:38,163 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 12:14:38,163 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 12:14:38,163 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:14:38,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2018-11-10 12:14:38,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 12:14:38,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:38,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:38,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:38,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:38,165 INFO L793 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 128#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 124#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 125#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 118#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 119#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 145#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 132#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 134#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 120#L510-5 [2018-11-10 12:14:38,165 INFO L795 eck$LassoCheckResult]: Loop: 120#L510-5 assume true; 121#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 142#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 135#L511-11 assume true; 136#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 156#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 158#L511-3 assume !strspn_#t~short7; 150#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 140#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 141#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 148#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 120#L510-5 [2018-11-10 12:14:38,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1273994252, now seen corresponding path program 2 times [2018-11-10 12:14:38,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 731488820, now seen corresponding path program 1 times [2018-11-10 12:14:38,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:14:38,251 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:14:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:14:38,252 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 12:14:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:38,340 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-10 12:14:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:14:38,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2018-11-10 12:14:38,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2018-11-10 12:14:38,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 71 transitions. [2018-11-10 12:14:38,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-10 12:14:38,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-10 12:14:38,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 71 transitions. [2018-11-10 12:14:38,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:38,344 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-10 12:14:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 71 transitions. [2018-11-10 12:14:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-11-10 12:14:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 12:14:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 12:14:38,347 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 12:14:38,347 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 12:14:38,347 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:14:38,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2018-11-10 12:14:38,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 12:14:38,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:38,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:38,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:38,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:38,348 INFO L793 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 249#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 245#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 246#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 239#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 240#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 266#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 253#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 255#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 241#L510-5 [2018-11-10 12:14:38,349 INFO L795 eck$LassoCheckResult]: Loop: 241#L510-5 assume true; 242#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 263#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 256#L511-11 assume true; 257#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 278#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 280#L511-3 assume strspn_#t~short7; 281#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 282#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 270#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 271#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 284#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 283#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 269#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 241#L510-5 [2018-11-10 12:14:38,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1273994252, now seen corresponding path program 3 times [2018-11-10 12:14:38,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 37794483, now seen corresponding path program 1 times [2018-11-10 12:14:38,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash -786636930, now seen corresponding path program 1 times [2018-11-10 12:14:38,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:38,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:38,586 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-10 12:14:39,043 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 150 [2018-11-10 12:14:39,199 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 12:14:39,208 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:39,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:39,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:39,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:39,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:39,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:39,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:39,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:39,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-11-10 12:14:39,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:39,209 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:39,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:39,600 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2018-11-10 12:14:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:40,093 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:14:40,096 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:14:40,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:40,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:40,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,219 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:40,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:40,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:14:40,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:14:40,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:40,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:40,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:40,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:40,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:40,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:40,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:40,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:40,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:40,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:14:40,293 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:14:40,293 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:14:40,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:14:40,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:14:40,298 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:14:40,299 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-10 12:14:40,453 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:14:40,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:14:40,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:40,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:40,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:40,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 12:14:40,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 53 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-10 12:14:40,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 53 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 117 states and 137 transitions. Complement of second has 10 states. [2018-11-10 12:14:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 12:14:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:14:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-10 12:14:40,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-10 12:14:40,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:40,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 24 letters. Loop has 14 letters. [2018-11-10 12:14:40,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:40,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 10 letters. Loop has 28 letters. [2018-11-10 12:14:40,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:40,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 137 transitions. [2018-11-10 12:14:40,665 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2018-11-10 12:14:40,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 98 states and 114 transitions. [2018-11-10 12:14:40,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 12:14:40,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-10 12:14:40,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 114 transitions. [2018-11-10 12:14:40,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:40,667 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 114 transitions. [2018-11-10 12:14:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 114 transitions. [2018-11-10 12:14:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2018-11-10 12:14:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 12:14:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-11-10 12:14:40,670 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-11-10 12:14:40,670 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-11-10 12:14:40,670 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:14:40,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 89 transitions. [2018-11-10 12:14:40,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 12:14:40,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:40,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:40,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,671 INFO L793 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 575#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 572#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 568#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 569#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 559#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 560#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 595#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 576#L532 assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0; 577#L532-1 SUMMARY for call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8); srcloc: L532-1 589#L532-2 strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 592#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 561#L510-5 [2018-11-10 12:14:40,672 INFO L795 eck$LassoCheckResult]: Loop: 561#L510-5 assume true; 562#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 590#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 579#L511-11 assume true; 580#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 612#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 615#L511-3 assume strspn_#t~short7; 618#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 620#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 627#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 626#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 625#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 624#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 598#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 561#L510-5 [2018-11-10 12:14:40,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash 242673519, now seen corresponding path program 1 times [2018-11-10 12:14:40,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:40,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:40,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:14:40,706 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:14:40,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 37794483, now seen corresponding path program 2 times [2018-11-10 12:14:40,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:40,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:14:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:14:40,804 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-10 12:14:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:40,818 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-10 12:14:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:14:40,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2018-11-10 12:14:40,820 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:40,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 64 transitions. [2018-11-10 12:14:40,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 12:14:40,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 12:14:40,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-11-10 12:14:40,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:40,821 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-10 12:14:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-11-10 12:14:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 12:14:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:14:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-10 12:14:40,823 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-10 12:14:40,823 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-10 12:14:40,824 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:14:40,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-11-10 12:14:40,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:40,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:40,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:40,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,825 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,825 INFO L793 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 714#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 711#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 707#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 708#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 699#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 700#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 731#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 715#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 716#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 701#L510-5 assume true; 703#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 727#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 717#L511-11 [2018-11-10 12:14:40,825 INFO L795 eck$LassoCheckResult]: Loop: 717#L511-11 assume true; 718#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 746#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 749#L511-3 assume !strspn_#t~short7; 736#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 740#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 717#L511-11 [2018-11-10 12:14:40,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1063204586, now seen corresponding path program 1 times [2018-11-10 12:14:40,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2042251692, now seen corresponding path program 1 times [2018-11-10 12:14:40,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:40,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:40,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:40,850 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:40,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:40,851 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-10 12:14:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:40,860 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-10 12:14:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:40,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2018-11-10 12:14:40,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:40,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 63 transitions. [2018-11-10 12:14:40,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 12:14:40,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 12:14:40,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 63 transitions. [2018-11-10 12:14:40,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:40,862 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 12:14:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 63 transitions. [2018-11-10 12:14:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 12:14:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:14:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-10 12:14:40,864 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 12:14:40,864 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 12:14:40,864 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:14:40,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 63 transitions. [2018-11-10 12:14:40,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:40,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:40,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:40,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:40,865 INFO L793 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 830#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 826#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 827#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 818#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 819#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 851#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 833#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 834#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 820#L510-5 assume true; 822#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 846#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 835#L511-11 [2018-11-10 12:14:40,865 INFO L795 eck$LassoCheckResult]: Loop: 835#L511-11 assume true; 836#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 865#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 868#L511-3 assume strspn_#t~short7; 870#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 872#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 854#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 855#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 864#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 835#L511-11 [2018-11-10 12:14:40,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1063204586, now seen corresponding path program 2 times [2018-11-10 12:14:40,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1939220501, now seen corresponding path program 1 times [2018-11-10 12:14:40,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash 866219638, now seen corresponding path program 1 times [2018-11-10 12:14:40,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:40,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:40,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:41,420 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 167 [2018-11-10 12:14:41,563 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-11-10 12:14:41,564 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:41,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:41,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:41,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:41,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:41,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:41,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:41,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:41,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration6_Lasso [2018-11-10 12:14:41,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:41,565 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:41,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:41,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,033 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 143 [2018-11-10 12:14:42,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:42,336 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-11-10 12:14:42,717 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:14:42,717 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:14:42,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:42,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:42,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:42,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:42,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:42,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:42,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:42,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:42,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:42,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:42,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:42,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:14:42,863 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:14:42,863 INFO L444 ModelExtractionUtils]: 73 out of 79 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:14:42,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:14:42,864 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:14:42,864 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:14:42,864 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-10 12:14:42,958 INFO L297 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2018-11-10 12:14:42,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:14:42,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:43,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:43,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:43,069 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-11-10 12:14:43,069 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 63 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 12:14:43,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 63 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 165 states and 185 transitions. Complement of second has 10 states. [2018-11-10 12:14:43,160 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-11-10 12:14:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:14:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-10 12:14:43,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-10 12:14:43,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:43,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 22 letters. Loop has 9 letters. [2018-11-10 12:14:43,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:43,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 13 letters. Loop has 18 letters. [2018-11-10 12:14:43,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:43,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 185 transitions. [2018-11-10 12:14:43,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2018-11-10 12:14:43,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 136 states and 152 transitions. [2018-11-10 12:14:43,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-10 12:14:43,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-10 12:14:43,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 152 transitions. [2018-11-10 12:14:43,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:43,164 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 152 transitions. [2018-11-10 12:14:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 152 transitions. [2018-11-10 12:14:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 92. [2018-11-10 12:14:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 12:14:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-11-10 12:14:43,172 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-11-10 12:14:43,172 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-11-10 12:14:43,172 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:14:43,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 104 transitions. [2018-11-10 12:14:43,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:43,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:43,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:43,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:43,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:43,174 INFO L793 eck$LassoCheckResult]: Stem: 1305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1267#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 1263#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 1264#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1253#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1254#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 1287#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1271#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1272#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1255#L510-5 assume true; 1257#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 1327#L510-2 assume !(strspn_#t~mem10 != 0);havoc strspn_#t~mem10; 1261#L510-6 strspn_#res := strspn_~l~0; 1262#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 1289#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 1298#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1286#L523-5 [2018-11-10 12:14:43,175 INFO L795 eck$LassoCheckResult]: Loop: 1286#L523-5 assume true; 1288#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 1277#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1278#L524-5 assume true; 1265#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 1266#L524-2 assume !(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 1268#L524-6 strcspn_#t~pre16 := strcspn_~l~1 + 1;strcspn_~l~1 := strcspn_~l~1 + 1;havoc strcspn_#t~pre16; 1285#L523-4 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 1286#L523-5 [2018-11-10 12:14:43,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2108688135, now seen corresponding path program 1 times [2018-11-10 12:14:43,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:43,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:43,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:43,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:14:43,309 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:14:43,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1670337973, now seen corresponding path program 1 times [2018-11-10 12:14:43,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:14:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:14:43,351 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-10 12:14:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:43,481 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-10 12:14:43,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:14:43,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 114 transitions. [2018-11-10 12:14:43,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:43,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 99 states and 110 transitions. [2018-11-10 12:14:43,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 12:14:43,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-10 12:14:43,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 110 transitions. [2018-11-10 12:14:43,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:43,484 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-11-10 12:14:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 110 transitions. [2018-11-10 12:14:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-11-10 12:14:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 12:14:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-11-10 12:14:43,488 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-10 12:14:43,488 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-10 12:14:43,488 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:14:43,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 103 transitions. [2018-11-10 12:14:43,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 12:14:43,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:43,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:43,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:43,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:43,490 INFO L793 eck$LassoCheckResult]: Stem: 1528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1487#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 1483#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 1484#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1473#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1474#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 1510#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1491#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1492#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1475#L510-5 assume true; 1477#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 1504#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1493#L511-11 assume true; 1494#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 1525#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 1529#L511-3 assume !strspn_#t~short7; 1515#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 1500#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 1501#L512 assume strspn_#t~mem8 == 0;havoc strspn_#t~mem8; 1481#L510-6 strspn_#res := strspn_~l~0; 1482#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 1512#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 1521#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1507#L523-5 [2018-11-10 12:14:43,490 INFO L795 eck$LassoCheckResult]: Loop: 1507#L523-5 assume true; 1511#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 1498#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1499#L524-5 assume true; 1485#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 1486#L524-2 assume !(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 1488#L524-6 strcspn_#t~pre16 := strcspn_~l~1 + 1;strcspn_~l~1 := strcspn_~l~1 + 1;havoc strcspn_#t~pre16; 1506#L523-4 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 1507#L523-5 [2018-11-10 12:14:43,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1706709058, now seen corresponding path program 1 times [2018-11-10 12:14:43,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:43,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1670337973, now seen corresponding path program 2 times [2018-11-10 12:14:43,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:43,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1612533000, now seen corresponding path program 1 times [2018-11-10 12:14:43,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:43,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:44,336 WARN L179 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 207 [2018-11-10 12:14:44,528 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-11-10 12:14:44,530 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:44,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:44,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:44,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:44,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:44,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:44,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:44,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:44,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-11-10 12:14:44,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:44,531 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:44,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:44,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,105 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 172 [2018-11-10 12:14:45,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:45,592 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2018-11-10 12:14:46,005 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-10 12:14:46,098 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:14:46,098 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:14:46,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:46,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:46,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:46,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:46,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:46,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,131 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:46,132 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:14:46,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,133 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 12:14:46,133 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:14:46,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:46,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:46,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:46,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,148 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:46,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,149 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:46,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,160 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:46,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,163 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:46,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:46,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:46,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:46,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:46,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:46,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:46,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:46,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:46,235 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:14:46,249 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:14:46,249 INFO L444 ModelExtractionUtils]: 99 out of 103 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:14:46,249 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:14:46,250 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:14:46,250 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:14:46,250 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-10 12:14:46,367 INFO L297 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2018-11-10 12:14:46,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:14:46,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:46,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:46,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:46,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 12:14:46,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 103 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-10 12:14:46,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 103 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 104 states and 117 transitions. Complement of second has 8 states. [2018-11-10 12:14:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:14:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 12:14:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-10 12:14:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 12:14:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-10 12:14:46,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:46,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 24 letters. Loop has 16 letters. [2018-11-10 12:14:46,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:46,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 117 transitions. [2018-11-10 12:14:46,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:46,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 102 states and 115 transitions. [2018-11-10 12:14:46,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-10 12:14:46,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 12:14:46,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 115 transitions. [2018-11-10 12:14:46,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:46,499 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-10 12:14:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 115 transitions. [2018-11-10 12:14:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-10 12:14:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 12:14:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-11-10 12:14:46,504 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-10 12:14:46,504 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-10 12:14:46,504 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:14:46,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 115 transitions. [2018-11-10 12:14:46,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:46,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:46,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:46,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:46,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:46,506 INFO L793 eck$LassoCheckResult]: Stem: 1996#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1948#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 1942#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 1943#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1932#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1933#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 1972#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1953#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1954#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1934#L510-5 assume true; 1936#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 1967#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1971#L511-11 assume true; 2014#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 1997#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 1998#L511-3 assume !strspn_#t~short7; 1979#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 1963#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 1964#L512 assume strspn_#t~mem8 == 0;havoc strspn_#t~mem8; 1940#L510-6 strspn_#res := strspn_~l~0; 1941#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 1976#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 1988#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1973#L523-5 assume true; 1975#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 1959#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1960#L524-5 [2018-11-10 12:14:46,506 INFO L795 eck$LassoCheckResult]: Loop: 1960#L524-5 assume true; 1944#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 1945#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 1949#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 1982#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 1986#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 1989#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 1960#L524-5 [2018-11-10 12:14:46,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -746615367, now seen corresponding path program 1 times [2018-11-10 12:14:46,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:46,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:46,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 249867939, now seen corresponding path program 1 times [2018-11-10 12:14:46,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:46,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:46,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash -837500437, now seen corresponding path program 1 times [2018-11-10 12:14:46,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:46,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:46,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:46,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:46,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 12:14:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:14:46,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:14:46,693 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. cyclomatic complexity: 19 Second operand 11 states. [2018-11-10 12:14:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:46,848 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2018-11-10 12:14:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:14:46,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 233 transitions. [2018-11-10 12:14:46,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2018-11-10 12:14:46,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 178 states and 197 transitions. [2018-11-10 12:14:46,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 12:14:46,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 12:14:46,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 197 transitions. [2018-11-10 12:14:46,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:46,854 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-11-10 12:14:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 197 transitions. [2018-11-10 12:14:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2018-11-10 12:14:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 12:14:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2018-11-10 12:14:46,858 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-11-10 12:14:46,858 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-11-10 12:14:46,858 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:14:46,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 122 transitions. [2018-11-10 12:14:46,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:46,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:46,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:46,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:46,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:46,860 INFO L793 eck$LassoCheckResult]: Stem: 2339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2291#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 2285#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 2286#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2275#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2276#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 2314#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2296#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2297#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2277#L510-5 assume true; 2279#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 2379#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2377#L511-11 assume true; 2378#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 2384#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 2383#L511-3 assume strspn_#t~short7; 2345#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 2346#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 2322#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2323#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 2308#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 2309#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 2319#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 2280#L510-5 assume true; 2282#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 2361#L510-2 assume !(strspn_#t~mem10 != 0);havoc strspn_#t~mem10; 2283#L510-6 strspn_#res := strspn_~l~0; 2284#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 2318#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 2331#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2315#L523-5 assume true; 2317#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 2302#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2303#L524-5 [2018-11-10 12:14:46,860 INFO L795 eck$LassoCheckResult]: Loop: 2303#L524-5 assume true; 2287#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 2288#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 2292#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 2324#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 2329#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2332#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 2303#L524-5 [2018-11-10 12:14:46,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1913426832, now seen corresponding path program 1 times [2018-11-10 12:14:46,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:47,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:14:47,058 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:14:47,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:47,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:47,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 12:14:47,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 12:14:47,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:14:47,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:14:47,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:14:47,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-11-10 12:14:47,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 12:14:47,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 12:14:47,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:14:47,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:14:47,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:14:47,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 12:14:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:47,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:14:47,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-11-10 12:14:47,420 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:14:47,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash 249867939, now seen corresponding path program 2 times [2018-11-10 12:14:47,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:47,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:47,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 12:14:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-11-10 12:14:47,468 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. cyclomatic complexity: 18 Second operand 21 states. [2018-11-10 12:14:49,795 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-10 12:14:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:49,944 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-11-10 12:14:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:14:49,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 176 transitions. [2018-11-10 12:14:49,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 12:14:49,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 156 states and 172 transitions. [2018-11-10 12:14:49,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-10 12:14:49,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 12:14:49,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 172 transitions. [2018-11-10 12:14:49,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:49,948 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 172 transitions. [2018-11-10 12:14:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 172 transitions. [2018-11-10 12:14:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 116. [2018-11-10 12:14:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 12:14:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-11-10 12:14:49,951 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-11-10 12:14:49,951 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-11-10 12:14:49,951 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:14:49,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 129 transitions. [2018-11-10 12:14:49,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:49,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:49,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:49,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:49,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:49,952 INFO L793 eck$LassoCheckResult]: Stem: 2752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2702#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 2696#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 2697#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2686#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2687#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 2729#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2711#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2712#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2688#L510-5 assume true; 2690#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 2774#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2772#L511-11 assume true; 2771#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 2770#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 2769#L511-3 assume strspn_#t~short7; 2768#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 2767#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 2766#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2765#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 2719#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 2720#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 2746#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 2691#L510-5 assume true; 2693#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 2725#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2706#L511-11 assume true; 2707#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 2750#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 2753#L511-3 assume strspn_#t~short7; 2755#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 2757#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 2733#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2734#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 2747#L511-10 [2018-11-10 12:14:49,953 INFO L795 eck$LassoCheckResult]: Loop: 2747#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2748#L511-11 assume true; 2801#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 2799#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 2791#L511-3 assume strspn_#t~short7; 2792#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 2800#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 2798#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2790#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 2747#L511-10 [2018-11-10 12:14:49,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1367265137, now seen corresponding path program 1 times [2018-11-10 12:14:49,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:49,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:49,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1464148837, now seen corresponding path program 2 times [2018-11-10 12:14:49,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:49,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:49,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 371241461, now seen corresponding path program 1 times [2018-11-10 12:14:49,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:50,783 WARN L179 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 208 [2018-11-10 12:14:50,966 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-10 12:14:50,968 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:50,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:50,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:50,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:50,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:50,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:50,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:50,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:50,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration11_Lasso [2018-11-10 12:14:50,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:50,968 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:50,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,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-11-10 12:14:51,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,484 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 149 [2018-11-10 12:14:51,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:51,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:52,289 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:14:52,290 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:14:52,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:52,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,339 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:52,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:52,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:52,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:52,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:52,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:52,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:52,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:52,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:52,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:52,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:52,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:52,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:14:52,433 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 12:14:52,442 INFO L444 ModelExtractionUtils]: 75 out of 82 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:14:52,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:14:52,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:14:52,443 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:14:52,443 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-10 12:14:52,676 INFO L297 tatePredicateManager]: 35 out of 36 supporting invariants were superfluous and have been removed [2018-11-10 12:14:52,677 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:14:52,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:52,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:52,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:52,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 12:14:52,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 129 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-10 12:14:52,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 129 transitions. cyclomatic complexity: 19. Second operand 8 states. Result 340 states and 382 transitions. Complement of second has 11 states. [2018-11-10 12:14:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:14:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:14:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-10 12:14:52,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 35 letters. Loop has 9 letters. [2018-11-10 12:14:52,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:52,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 44 letters. Loop has 9 letters. [2018-11-10 12:14:52,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:52,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 35 letters. Loop has 18 letters. [2018-11-10 12:14:52,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:52,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 382 transitions. [2018-11-10 12:14:52,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 12:14:52,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 263 states and 292 transitions. [2018-11-10 12:14:52,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-11-10 12:14:52,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-10 12:14:52,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2018-11-10 12:14:52,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:52,929 INFO L705 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2018-11-10 12:14:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2018-11-10 12:14:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 178. [2018-11-10 12:14:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 12:14:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-11-10 12:14:52,933 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-11-10 12:14:52,933 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-11-10 12:14:52,938 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:14:52,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 198 transitions. [2018-11-10 12:14:52,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:52,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:52,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:52,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:52,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:52,942 INFO L793 eck$LassoCheckResult]: Stem: 3528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 3478#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 3472#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 3473#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3462#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3463#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 3502#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 3483#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3484#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3464#L510-5 assume true; 3465#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 3501#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 3485#L511-11 assume true; 3486#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 3527#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 3531#L511-3 assume strspn_#t~short7; 3533#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 3536#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 3510#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 3511#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 3621#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 3620#L511-11 assume true; 3525#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 3526#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 3586#L511-3 assume !strspn_#t~short7; 3538#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 3493#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 3494#L512 assume strspn_#t~mem8 == 0;havoc strspn_#t~mem8; 3470#L510-6 strspn_#res := strspn_~l~0; 3471#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 3506#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 3519#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 3503#L523-5 assume true; 3505#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 3489#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3490#L524-5 [2018-11-10 12:14:52,942 INFO L795 eck$LassoCheckResult]: Loop: 3490#L524-5 assume true; 3474#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 3475#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 3479#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 3512#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 3517#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3520#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 3490#L524-5 [2018-11-10 12:14:52,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash -6991079, now seen corresponding path program 1 times [2018-11-10 12:14:52,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:52,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:52,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:52,964 INFO L82 PathProgramCache]: Analyzing trace with hash 249867939, now seen corresponding path program 3 times [2018-11-10 12:14:52,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:52,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:52,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash 207106187, now seen corresponding path program 1 times [2018-11-10 12:14:52,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:52,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:52,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:54,138 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 292 DAG size of output: 237 [2018-11-10 12:14:54,391 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-11-10 12:14:54,392 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:54,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:54,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:54,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:54,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:54,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:54,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:54,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:54,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-11-10 12:14:54,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:54,393 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:54,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:54,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,393 WARN L179 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 190 [2018-11-10 12:14:55,537 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-11-10 12:14:55,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,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-11-10 12:14:55,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:55,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:56,081 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2018-11-10 12:14:56,496 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 12:14:56,660 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-10 12:14:56,702 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:14:56,702 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:14:56,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:14:56,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:14:56,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:14:56,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,751 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:56,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,753 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:56,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:56,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:56,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,773 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:14:56,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,774 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:14:56,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,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-11-10 12:14:56,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,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-11-10 12:14:56,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:14:56,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:14:56,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:14:56,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:14:56,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:14:56,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:14:56,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:14:56,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:14:56,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:14:56,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:14:56,910 INFO L444 ModelExtractionUtils]: 98 out of 103 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:14:56,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:14:56,911 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:14:56,911 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:14:56,911 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-10 12:14:57,355 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2018-11-10 12:14:57,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:14:57,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:57,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:57,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:57,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:14:57,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 198 transitions. cyclomatic complexity: 29 Second operand 4 states. [2018-11-10 12:14:57,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 198 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 223 states and 246 transitions. Complement of second has 7 states. [2018-11-10 12:14:57,445 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-11-10 12:14:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:14:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-10 12:14:57,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 36 letters. Loop has 7 letters. [2018-11-10 12:14:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 43 letters. Loop has 7 letters. [2018-11-10 12:14:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 36 letters. Loop has 14 letters. [2018-11-10 12:14:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:14:57,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 246 transitions. [2018-11-10 12:14:57,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:57,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 196 states and 217 transitions. [2018-11-10 12:14:57,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 12:14:57,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 12:14:57,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 217 transitions. [2018-11-10 12:14:57,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:57,449 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 217 transitions. [2018-11-10 12:14:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 217 transitions. [2018-11-10 12:14:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2018-11-10 12:14:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 12:14:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-11-10 12:14:57,453 INFO L728 BuchiCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-11-10 12:14:57,453 INFO L608 BuchiCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-11-10 12:14:57,453 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:14:57,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 209 transitions. [2018-11-10 12:14:57,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:57,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:57,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:57,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:57,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:57,455 INFO L793 eck$LassoCheckResult]: Stem: 4308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4256#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 4250#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 4251#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4240#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4241#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 4283#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4264#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4265#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4242#L510-5 assume true; 4243#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 4274#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4259#L511-11 assume true; 4260#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 4401#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 4399#L511-3 assume strspn_#t~short7; 4398#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 4397#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 4360#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4359#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 4358#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 4357#L511-11 assume true; 4356#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 4355#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 4334#L511-3 assume !strspn_#t~short7; 4323#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 4270#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 4271#L512 assume strspn_#t~mem8 == 0;havoc strspn_#t~mem8; 4248#L510-6 strspn_#res := strspn_~l~0; 4249#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 4284#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 4300#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4279#L523-5 assume true; 4280#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 4342#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4340#L524-5 assume true; 4254#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 4255#L524-2 assume !(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 4258#L524-6 strcspn_#t~pre16 := strcspn_~l~1 + 1;strcspn_~l~1 := strcspn_~l~1 + 1;havoc strcspn_#t~pre16; 4276#L523-4 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4277#L523-5 assume true; 4282#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 4266#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4267#L524-5 [2018-11-10 12:14:57,455 INFO L795 eck$LassoCheckResult]: Loop: 4267#L524-5 assume true; 4252#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 4253#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 4257#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 4291#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 4297#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4301#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 4267#L524-5 [2018-11-10 12:14:57,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:57,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2079512975, now seen corresponding path program 1 times [2018-11-10 12:14:57,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:57,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:57,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:57,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:14:57,639 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6621a70d-701f-4e6e-9cd9-374b4c24ae29/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:14:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:57,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:14:57,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 12:14:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 12:14:57,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:14:57,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:14:57,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:14:57,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 12:14:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:14:57,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:14:57,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2018-11-10 12:14:57,864 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:14:57,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash 249867939, now seen corresponding path program 4 times [2018-11-10 12:14:57,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:57,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:57,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:57,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 12:14:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:14:57,948 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. cyclomatic complexity: 30 Second operand 20 states. [2018-11-10 12:14:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:58,389 INFO L93 Difference]: Finished difference Result 307 states and 333 transitions. [2018-11-10 12:14:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 12:14:58,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 333 transitions. [2018-11-10 12:14:58,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2018-11-10 12:14:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 303 states and 329 transitions. [2018-11-10 12:14:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-10 12:14:58,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-10 12:14:58,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 329 transitions. [2018-11-10 12:14:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:14:58,393 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 329 transitions. [2018-11-10 12:14:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 329 transitions. [2018-11-10 12:14:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 193. [2018-11-10 12:14:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 12:14:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-11-10 12:14:58,397 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-11-10 12:14:58,397 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-11-10 12:14:58,398 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 12:14:58,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 213 transitions. [2018-11-10 12:14:58,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:14:58,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:58,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:58,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:58,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:58,400 INFO L793 eck$LassoCheckResult]: Stem: 4985#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4936#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 4930#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 4931#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4920#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4921#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 4963#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4944#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4945#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4922#L510-5 assume true; 4924#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 5083#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 5061#L511-11 assume true; 5063#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 5100#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 5098#L511-3 assume strspn_#t~short7; 5097#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 5096#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 5095#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 5086#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 5084#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 5081#L511-11 assume true; 5054#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 5055#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 5048#L511-3 assume strspn_#t~short7; 5049#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 5044#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 5045#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 5039#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 5040#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 5033#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 5034#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 5027#L510-5 assume true; 5028#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 5022#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4998#L511-11 assume true; 5015#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 5016#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 5004#L511-3 assume strspn_#t~short7; 5005#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 5001#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 4999#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4972#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 4973#L511-10 [2018-11-10 12:14:58,400 INFO L795 eck$LassoCheckResult]: Loop: 4973#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 4939#L511-11 assume true; 4940#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 4983#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 4987#L511-3 assume strspn_#t~short7; 4991#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 4994#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 4966#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4967#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 4973#L511-10 [2018-11-10 12:14:58,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash -609667887, now seen corresponding path program 2 times [2018-11-10 12:14:58,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:58,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1464148837, now seen corresponding path program 3 times [2018-11-10 12:14:58,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:58,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -261990251, now seen corresponding path program 3 times [2018-11-10 12:14:58,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:58,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:59,444 WARN L179 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 227 [2018-11-10 12:14:59,691 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2018-11-10 12:14:59,692 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:14:59,692 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:14:59,692 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:14:59,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:14:59,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:14:59,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:59,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:14:59,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:14:59,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-11-10 12:14:59,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:14:59,693 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:14:59,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:14:59,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,198 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 160 [2018-11-10 12:15:00,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:00,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:01,168 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-10 12:15:01,253 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:15:01,253 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:15:01,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:01,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:01,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:01,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:01,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:01,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,287 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:15:01,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,287 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:15:01,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:01,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:01,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:01,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:01,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:01,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:01,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:01,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:01,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:01,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:01,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:01,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:01,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:01,326 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:15:01,347 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:15:01,348 INFO L444 ModelExtractionUtils]: 71 out of 76 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:15:01,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:15:01,348 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:15:01,349 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:15:01,349 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_6) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_6 Supporting invariants [] [2018-11-10 12:15:01,541 INFO L297 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2018-11-10 12:15:01,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:15:01,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:01,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 12:15:01,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30 Second operand 8 states. [2018-11-10 12:15:01,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30. Second operand 8 states. Result 410 states and 450 transitions. Complement of second has 11 states. [2018-11-10 12:15:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:15:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:15:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-10 12:15:01,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 82 transitions. Stem has 44 letters. Loop has 9 letters. [2018-11-10 12:15:01,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:01,707 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:15:01,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:01,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 12:15:01,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30 Second operand 8 states. [2018-11-10 12:15:01,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30. Second operand 8 states. Result 408 states and 445 transitions. Complement of second has 11 states. [2018-11-10 12:15:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:15:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:15:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-10 12:15:01,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 44 letters. Loop has 9 letters. [2018-11-10 12:15:01,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:01,866 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:15:01,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:01,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:01,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-11-10 12:15:01,934 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 12:15:01,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30 Second operand 8 states. [2018-11-10 12:15:02,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 213 transitions. cyclomatic complexity: 30. Second operand 8 states. Result 392 states and 435 transitions. Complement of second has 12 states. [2018-11-10 12:15:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:15:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:15:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2018-11-10 12:15:02,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 44 letters. Loop has 9 letters. [2018-11-10 12:15:02,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:02,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 53 letters. Loop has 9 letters. [2018-11-10 12:15:02,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:02,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 86 transitions. Stem has 44 letters. Loop has 18 letters. [2018-11-10 12:15:02,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:02,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 392 states and 435 transitions. [2018-11-10 12:15:02,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 12:15:02,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 392 states to 279 states and 305 transitions. [2018-11-10 12:15:02,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-10 12:15:02,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-10 12:15:02,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 305 transitions. [2018-11-10 12:15:02,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:15:02,070 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 305 transitions. [2018-11-10 12:15:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 305 transitions. [2018-11-10 12:15:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 145. [2018-11-10 12:15:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 12:15:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-11-10 12:15:02,073 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-11-10 12:15:02,073 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-11-10 12:15:02,073 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 12:15:02,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 158 transitions. [2018-11-10 12:15:02,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:15:02,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:15:02,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:15:02,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:15:02,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:15:02,075 INFO L793 eck$LassoCheckResult]: Stem: 7120#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 7069#L544 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset; 7063#L546 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L546 7064#L546-1 main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 7053#L548 assume !(main_~delim_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~delim_len~0;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~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 7054#L550 SUMMARY for call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8); srcloc: L550 7097#L550-1 assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 7077#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 7078#L532-4 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 7055#L510-5 assume true; 7056#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 7091#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 7072#L511-11 assume true; 7073#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 7153#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 7151#L511-3 assume strspn_#t~short7; 7149#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 7147#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 7145#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 7143#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 7142#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 7141#L511-11 assume true; 7140#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 7122#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 7123#L511-3 assume !strspn_#t~short7; 7101#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4; 7083#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 7084#L512 assume strspn_#t~mem8 == 0;havoc strspn_#t~mem8; 7061#L510-6 strspn_#res := strspn_~l~0; 7062#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296 * 1;havoc strtok_r_#t~ret19; 7098#L534 SUMMARY for call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); srcloc: L534 7112#L534-1 assume strtok_r_#t~mem20 != 0;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 7093#L523-5 assume true; 7094#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 7195#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 7126#L524-5 assume true; 7067#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 7068#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 7071#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 7188#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 7114#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 7115#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 7121#L524-5 assume true; 7186#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 7136#L524-2 assume !(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 7130#L524-6 strcspn_#t~pre16 := strcspn_~l~1 + 1;strcspn_~l~1 := strcspn_~l~1 + 1;havoc strcspn_#t~pre16; 7089#L523-4 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 7090#L523-5 assume true; 7096#L523-1 SUMMARY for call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L523-1 7079#L523-2 assume !!(strcspn_#t~mem17 != 0);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 7080#L524-5 [2018-11-10 12:15:02,075 INFO L795 eck$LassoCheckResult]: Loop: 7080#L524-5 assume true; 7065#L524-1 SUMMARY for call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L524-1 7066#L524-2 assume !!(strcspn_#t~mem15 != 0);havoc strcspn_#t~mem15; 7070#L525 SUMMARY for call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L525 7104#L525-1 SUMMARY for call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L525-1 7110#L525-2 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 7113#L524-4 strcspn_#t~pre12 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre12; 7080#L524-5 [2018-11-10 12:15:02,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1056824063, now seen corresponding path program 1 times [2018-11-10 12:15:02,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:02,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:15:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:02,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 249867939, now seen corresponding path program 5 times [2018-11-10 12:15:02,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:02,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash 320792995, now seen corresponding path program 2 times [2018-11-10 12:15:02,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:02,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:15:02,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:15:03,281 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 343 DAG size of output: 267 [2018-11-10 12:15:03,538 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 12:15:03,540 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:15:03,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:15:03,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:15:03,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:15:03,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:15:03,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:15:03,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:15:03,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:15:03,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration15_Lasso [2018-11-10 12:15:03,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:15:03,540 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:15:03,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:03,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,313 WARN L179 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 196 [2018-11-10 12:15:04,426 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-11-10 12:15:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:15:04,764 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2018-11-10 12:15:05,092 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-10 12:15:05,440 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-10 12:15:05,464 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:15:05,464 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:15:05,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:05,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:05,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:15:05,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:15:05,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:15:05,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:05,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:05,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:15:05,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:15:05,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:15:05,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:15:05,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:15:05,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:15:05,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:15:05,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:15:05,621 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:15:05,683 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 12:15:05,683 INFO L444 ModelExtractionUtils]: 98 out of 106 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:15:05,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:15:05,684 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:15:05,684 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:15:05,684 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-10 12:15:05,984 INFO L297 tatePredicateManager]: 51 out of 51 supporting invariants were superfluous and have been removed [2018-11-10 12:15:05,986 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:15:06,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:06,043 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:15:06,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-10 12:15:06,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 167 states and 182 transitions. Complement of second has 7 states. [2018-11-10 12:15:06,055 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-11-10 12:15:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:15:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-10 12:15:06,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 51 letters. Loop has 7 letters. [2018-11-10 12:15:06,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:06,056 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:15:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:06,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:15:06,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-10 12:15:06,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 167 states and 182 transitions. Complement of second has 7 states. [2018-11-10 12:15:06,123 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-11-10 12:15:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:15:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-11-10 12:15:06,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 51 letters. Loop has 7 letters. [2018-11-10 12:15:06,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:06,123 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:15:06,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:06,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:06,171 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:15:06,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-10 12:15:06,183 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 158 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 175 states and 192 transitions. Complement of second has 6 states. [2018-11-10 12:15:06,184 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-11-10 12:15:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:15:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-10 12:15:06,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 51 letters. Loop has 7 letters. [2018-11-10 12:15:06,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:06,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 58 letters. Loop has 7 letters. [2018-11-10 12:15:06,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:06,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 51 letters. Loop has 14 letters. [2018-11-10 12:15:06,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:15:06,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 192 transitions. [2018-11-10 12:15:06,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:15:06,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 0 states and 0 transitions. [2018-11-10 12:15:06,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:15:06,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:15:06,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:15:06,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:15:06,187 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:15:06,187 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:15:06,188 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:15:06,188 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 12:15:06,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:15:06,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:15:06,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:15:06,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:15:06 BoogieIcfgContainer [2018-11-10 12:15:06,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:15:06,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:15:06,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:15:06,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:15:06,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:37" (3/4) ... [2018-11-10 12:15:06,198 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:15:06,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:15:06,198 INFO L168 Benchmark]: Toolchain (without parser) took 29079.86 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 619.7 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -436.0 MB). Peak memory consumption was 183.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,199 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:15:06,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.10 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,200 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,201 INFO L168 Benchmark]: RCFGBuilder took 363.50 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,201 INFO L168 Benchmark]: BuchiAutomizer took 28297.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 491.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -303.9 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:15:06,201 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:15:06,204 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.10 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.50 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28297.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 491.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -303.9 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 15 terminating modules (8 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (delim_len)] + -1 * a and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (delim_len)] + -1 * a and consists of 8 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 4 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.2s and 16 iterations. TraceHistogramMax:3. Analysis of lassos took 23.1s. Construction of modules took 0.7s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 535 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 193 states and ocurred in iteration 13. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 911 SDtfs, 2477 SDslu, 1374 SDs, 0 SdLazy, 1148 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital348 mio100 ax100 hnf99 lsp95 ukn102 mio100 lsp40 div106 bol100 ite100 ukn100 eq199 hnf85 smp97 dnf157 smp87 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...