./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/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_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/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-635dfa2 [2018-12-09 06:29:36,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:29:36,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:29:36,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:29:36,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:29:36,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:29:36,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:29:36,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:29:36,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:29:36,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:29:36,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:29:36,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:29:36,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:29:36,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:29:36,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:29:36,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:29:36,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:29:36,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:29:36,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:29:36,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:29:36,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:29:36,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:29:36,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:29:36,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:29:36,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:29:36,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:29:36,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:29:36,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:29:36,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:29:36,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:29:36,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:29:36,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:29:36,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:29:36,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:29:36,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:29:36,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:29:36,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 06:29:36,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:29:36,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:29:36,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:29:36,292 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 06:29:36,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:29:36,292 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 06:29:36,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:29:36,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:29:36,294 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 06:29:36,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:29:36,294 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:29:36,294 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 06:29:36,294 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 06:29:36,295 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_ff89ae93-b80a-46dd-93da-69d8a08b58a7/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-12-09 06:29:36,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:29:36,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:29:36,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:29:36,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:29:36,326 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:29:36,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-12-09 06:29:36,365 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/data/cc1bf770d/7ce3149d99194107b04ca07df086d43d/FLAG685243509 [2018-12-09 06:29:36,725 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:29:36,725 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-12-09 06:29:36,732 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/data/cc1bf770d/7ce3149d99194107b04ca07df086d43d/FLAG685243509 [2018-12-09 06:29:37,104 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/data/cc1bf770d/7ce3149d99194107b04ca07df086d43d [2018-12-09 06:29:37,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:29:37,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:29:37,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:29:37,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:29:37,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:29:37,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda5476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37, skipping insertion in model container [2018-12-09 06:29:37,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:29:37,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:29:37,299 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:29:37,305 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:29:37,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:29:37,383 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:29:37,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37 WrapperNode [2018-12-09 06:29:37,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:29:37,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:29:37,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:29:37,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:29:37,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:29:37,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:29:37,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:29:37,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:29:37,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... [2018-12-09 06:29:37,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:29:37,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:29:37,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:29:37,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:29:37,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 06:29:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:29:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:29:37,649 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:29:37,649 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-09 06:29:37,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:37 BoogieIcfgContainer [2018-12-09 06:29:37,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:29:37,650 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 06:29:37,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 06:29:37,652 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 06:29:37,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:37,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 06:29:37" (1/3) ... [2018-12-09 06:29:37,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0d89b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:29:37, skipping insertion in model container [2018-12-09 06:29:37,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:37,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:37" (2/3) ... [2018-12-09 06:29:37,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0d89b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:29:37, skipping insertion in model container [2018-12-09 06:29:37,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:37,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:37" (3/3) ... [2018-12-09 06:29:37,655 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-12-09 06:29:37,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:29:37,684 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 06:29:37,684 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 06:29:37,684 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 06:29:37,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:29:37,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:29:37,685 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 06:29:37,685 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:29:37,685 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 06:29:37,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-12-09 06:29:37,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:37,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:37,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:37,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,710 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 06:29:37,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-12-09 06:29:37,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:37,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:37,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:37,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,716 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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; 7#L544true assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3#L548true assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 9#L532true assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);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; 12#L532-2true 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; 20#L510-4true [2018-12-09 06:29:37,717 INFO L796 eck$LassoCheckResult]: Loop: 20#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 11#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 21#L511-6true assume !true; 22#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 25#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 16#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 20#L510-4true [2018-12-09 06:29:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2018-12-09 06:29:37,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:37,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:29:37,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:37,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2018-12-09 06:29:37,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:37,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 06:29:37,827 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 06:29:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 06:29:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 06:29:37,838 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-12-09 06:29:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:37,843 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-09 06:29:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 06:29:37,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2018-12-09 06:29:37,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:37,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2018-12-09 06:29:37,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 06:29:37,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 06:29:37,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-09 06:29:37,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:29:37,849 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 06:29:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-09 06:29:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-09 06:29:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 06:29:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-09 06:29:37,865 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 06:29:37,866 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 06:29:37,866 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 06:29:37,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-12-09 06:29:37,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:37,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:37,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:37,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:37,867 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 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; 85#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 78#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 79#L532 assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);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; 87#L532-2 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; 92#L510-4 [2018-12-09 06:29:37,867 INFO L796 eck$LassoCheckResult]: Loop: 92#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 90#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 91#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 96#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 101#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 97#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 98#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 94#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 92#L510-4 [2018-12-09 06:29:37,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2018-12-09 06:29:37,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:37,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:37,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:29:37,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:37,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2018-12-09 06:29:37,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:37,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:29:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:29:38,045 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 06:29:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:38,064 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-09 06:29:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 06:29:38,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-12-09 06:29:38,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:38,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2018-12-09 06:29:38,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 06:29:38,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 06:29:38,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-12-09 06:29:38,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:29:38,066 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 06:29:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-12-09 06:29:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-09 06:29:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 06:29:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-09 06:29:38,067 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 06:29:38,067 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 06:29:38,067 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 06:29:38,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-12-09 06:29:38,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 06:29:38,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:38,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:38,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:38,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:38,068 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 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; 146#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 139#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 140#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 148#L532-2 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; 153#L510-4 [2018-12-09 06:29:38,068 INFO L796 eck$LassoCheckResult]: Loop: 153#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 151#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 152#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 157#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 158#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 159#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 155#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 153#L510-4 [2018-12-09 06:29:38,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-12-09 06:29:38,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2018-12-09 06:29:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2018-12-09 06:29:38,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:38,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:38,576 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 142 [2018-12-09 06:29:38,714 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-09 06:29:38,721 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:38,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:38,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:38,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:38,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:38,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:38,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:38,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:38,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-12-09 06:29:38,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:38,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:38,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:38,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:39,035 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2018-12-09 06:29:39,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:39,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:39,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:39,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,469 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 06:29:39,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,470 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 06:29:39,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:39,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:39,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:39,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:39,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,498 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:39,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,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-12-09 06:29:39,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:39,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:39,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:39,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:39,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:39,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:39,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:39,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:39,524 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:39,537 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:29:39,537 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 06:29:39,539 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:39,540 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:39,540 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:39,540 INFO L520 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-12-09 06:29:39,564 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-12-09 06:29:39,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:39,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:39,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:39,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:39,640 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-12-09 06:29:39,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-09 06:29:39,701 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 46 states and 57 transitions. Complement of second has 6 states. [2018-12-09 06:29:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-09 06:29:39,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-09 06:29:39,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:39,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2018-12-09 06:29:39,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2018-12-09 06:29:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:39,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-12-09 06:29:39,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:39,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2018-12-09 06:29:39,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 06:29:39,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-09 06:29:39,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-12-09 06:29:39,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:39,707 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-09 06:29:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-12-09 06:29:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 06:29:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 06:29:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-09 06:29:39,709 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-09 06:29:39,709 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-09 06:29:39,709 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 06:29:39,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-12-09 06:29:39,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:39,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:39,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:39,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:39,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:39,710 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 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; 340#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 333#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 334#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 342#L532-2 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; 349#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 345#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 346#L511-6 [2018-12-09 06:29:39,711 INFO L796 eck$LassoCheckResult]: Loop: 346#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 354#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 362#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 365#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 346#L511-6 [2018-12-09 06:29:39,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2018-12-09 06:29:39,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:39,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:39,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:39,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2018-12-09 06:29:39,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:39,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:39,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2018-12-09 06:29:39,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:40,178 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 155 [2018-12-09 06:29:40,347 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-09 06:29:40,349 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:40,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:40,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:40,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:40,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:40,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:40,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:40,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:40,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2018-12-09 06:29:40,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:40,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:40,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,629 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-12-09 06:29:40,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:41,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:41,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:41,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-12-09 06:29:41,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,123 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:41,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,124 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:41,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,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-12-09 06:29:41,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,135 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:41,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,136 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:41,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:41,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:41,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:41,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:41,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:41,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:41,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:41,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:41,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:41,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:41,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:41,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:41,172 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:29:41,172 INFO L444 ModelExtractionUtils]: 60 out of 64 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 06:29:41,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:41,172 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:41,173 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:41,173 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2 Supporting invariants [] [2018-12-09 06:29:41,222 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-12-09 06:29:41,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:41,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:41,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:41,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:41,277 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-12-09 06:29:41,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-09 06:29:41,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 100 states and 123 transitions. Complement of second has 7 states. [2018-12-09 06:29:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-12-09 06:29:41,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 06:29:41,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:41,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-09 06:29:41,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:41,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-09 06:29:41,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:41,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2018-12-09 06:29:41,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-12-09 06:29:41,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2018-12-09 06:29:41,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-09 06:29:41,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 06:29:41,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2018-12-09 06:29:41,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:41,335 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-12-09 06:29:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2018-12-09 06:29:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-12-09 06:29:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 06:29:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-12-09 06:29:41,339 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-12-09 06:29:41,339 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-12-09 06:29:41,339 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 06:29:41,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-12-09 06:29:41,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:41,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:41,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:41,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:41,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:41,340 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 633#L-1 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; 631#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 624#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 625#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 632#L532-2 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; 640#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 636#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 626#L510-5 strspn_#res := strspn_~l~0; 627#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 644#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 635#L523-4 [2018-12-09 06:29:41,341 INFO L796 eck$LassoCheckResult]: Loop: 635#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 641#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 655#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 628#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 629#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 634#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 635#L523-4 [2018-12-09 06:29:41,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2018-12-09 06:29:41,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:41,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 06:29:41,452 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:41,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2018-12-09 06:29:41,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:41,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 06:29:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 06:29:41,499 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2018-12-09 06:29:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:41,677 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-12-09 06:29:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 06:29:41,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-12-09 06:29:41,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:41,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-12-09 06:29:41,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-09 06:29:41,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-09 06:29:41,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-12-09 06:29:41,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:41,679 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-12-09 06:29:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-12-09 06:29:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-12-09 06:29:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 06:29:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-12-09 06:29:41,682 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-09 06:29:41,682 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-09 06:29:41,682 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 06:29:41,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-12-09 06:29:41,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:41,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:41,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:41,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:41,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:41,683 INFO L794 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 763#L-1 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; 762#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 755#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 756#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 764#L532-2 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; 771#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 776#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 800#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 787#L511-1 assume !strspn_#t~short7; 788#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 782#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 783#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 773#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 774#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 767#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 768#L511-6 [2018-12-09 06:29:41,684 INFO L796 eck$LassoCheckResult]: Loop: 768#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 778#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 786#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 791#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 768#L511-6 [2018-12-09 06:29:41,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2018-12-09 06:29:41,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:41,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:41,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:29:41,705 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:41,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2018-12-09 06:29:41,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:29:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:29:41,803 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-12-09 06:29:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:41,831 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-12-09 06:29:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:29:41,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 91 transitions. [2018-12-09 06:29:41,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-09 06:29:41,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 87 transitions. [2018-12-09 06:29:41,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-09 06:29:41,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-09 06:29:41,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-12-09 06:29:41,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:41,833 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-09 06:29:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-12-09 06:29:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-12-09 06:29:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 06:29:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-12-09 06:29:41,836 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-09 06:29:41,836 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-09 06:29:41,836 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 06:29:41,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2018-12-09 06:29:41,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 06:29:41,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:41,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:41,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:41,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:29:41,837 INFO L794 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 896#L-1 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; 895#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 888#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 889#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 897#L532-2 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; 904#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 900#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 901#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 929#L511-1 assume !strspn_#t~short7; 925#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 915#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 916#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 890#L510-5 strspn_#res := strspn_~l~0; 891#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 908#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 899#L523-4 [2018-12-09 06:29:41,837 INFO L796 eck$LassoCheckResult]: Loop: 899#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 905#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 920#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 892#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 893#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 898#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 899#L523-4 [2018-12-09 06:29:41,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2018-12-09 06:29:41,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:41,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2018-12-09 06:29:41,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:41,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2018-12-09 06:29:41,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:41,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:41,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:41,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:42,499 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 196 [2018-12-09 06:29:42,713 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-12-09 06:29:42,714 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:42,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:42,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:42,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:42,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:42,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:42,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:42,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:42,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration7_Lasso [2018-12-09 06:29:42,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:42,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:42,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:42,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,127 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2018-12-09 06:29:43,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,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-12-09 06:29:43,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-12-09 06:29:43,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,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-12-09 06:29:43,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-12-09 06:29:43,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:43,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:43,691 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:43,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:43,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:43,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,728 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:43,728 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 06:29:43,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,730 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 06:29:43,730 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 06:29:43,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:43,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:43,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:43,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,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-12-09 06:29:43,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:43,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:43,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:43,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:43,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:43,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:43,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:43,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:43,764 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:43,782 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 06:29:43,782 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 06:29:43,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:43,783 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:43,783 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:43,783 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~s.offset, v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1) = -1*ULTIMATE.start_strcspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 Supporting invariants [] [2018-12-09 06:29:43,882 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2018-12-09 06:29:43,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:43,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:43,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:43,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:43,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 06:29:43,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 64 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-12-09 06:29:43,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 64 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 58 states and 74 transitions. Complement of second has 4 states. [2018-12-09 06:29:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 06:29:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-12-09 06:29:43,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2018-12-09 06:29:43,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:43,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-09 06:29:43,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:43,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2018-12-09 06:29:43,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:43,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-12-09 06:29:43,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 06:29:43,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 72 transitions. [2018-12-09 06:29:43,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 06:29:43,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 06:29:43,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2018-12-09 06:29:43,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:43,933 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-09 06:29:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2018-12-09 06:29:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 06:29:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 06:29:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-12-09 06:29:43,935 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-09 06:29:43,935 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-09 06:29:43,936 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 06:29:43,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-12-09 06:29:43,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 06:29:43,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:43,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:43,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:43,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:43,937 INFO L794 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 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; 1207#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1198#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 1199#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1209#L532-2 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; 1216#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1214#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1215#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1227#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1243#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 1231#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1232#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 1220#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 1221#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1224#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1225#L511-6 [2018-12-09 06:29:43,937 INFO L796 eck$LassoCheckResult]: Loop: 1225#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1226#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1244#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 1242#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 1225#L511-6 [2018-12-09 06:29:43,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2018-12-09 06:29:43,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:43,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2018-12-09 06:29:43,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2018-12-09 06:29:43,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:43,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:44,583 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 186 [2018-12-09 06:29:44,736 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-09 06:29:44,738 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:44,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:44,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:44,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:44,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:44,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:44,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:44,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:44,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-12-09 06:29:44,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:44,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:44,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:44,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,194 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-12-09 06:29:45,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,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-12-09 06:29:45,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-12-09 06:29:45,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,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-12-09 06:29:45,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:45,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-12-09 06:29:45,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:45,672 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:45,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,692 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-09 06:29:45,692 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-09 06:29:45,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,698 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-12-09 06:29:45,698 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-09 06:29:45,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,728 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:45,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:45,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:45,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:45,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:45,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,741 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:45,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,741 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:45,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,744 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:45,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,745 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:45,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:45,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:45,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-12-09 06:29:45,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:45,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:45,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:45,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:45,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:45,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:45,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:45,772 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:29:45,772 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 06:29:45,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:45,773 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:45,773 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:45,773 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4 Supporting invariants [] [2018-12-09 06:29:45,858 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-12-09 06:29:45,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:45,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:45,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:45,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:45,907 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-12-09 06:29:45,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-09 06:29:45,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 116 states and 147 transitions. Complement of second has 7 states. [2018-12-09 06:29:45,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-09 06:29:45,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-09 06:29:45,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:45,945 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:29:45,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:45,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:45,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:45,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 06:29:45,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-09 06:29:46,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 116 states and 147 transitions. Complement of second has 7 states. [2018-12-09 06:29:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-09 06:29:46,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-09 06:29:46,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:46,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:29:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:46,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:46,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:46,087 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 06:29:46,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-09 06:29:46,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 99 states and 130 transitions. Complement of second has 6 states. [2018-12-09 06:29:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-09 06:29:46,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-09 06:29:46,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:46,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-09 06:29:46,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:46,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-09 06:29:46,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:46,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2018-12-09 06:29:46,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:46,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2018-12-09 06:29:46,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 06:29:46,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 06:29:46,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2018-12-09 06:29:46,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:46,128 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2018-12-09 06:29:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2018-12-09 06:29:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-12-09 06:29:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 06:29:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-12-09 06:29:46,129 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 06:29:46,130 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 06:29:46,130 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 06:29:46,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-12-09 06:29:46,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:46,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:46,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:46,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:46,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:46,130 INFO L794 eck$LassoCheckResult]: Stem: 1987#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1957#L-1 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; 1956#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1947#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 1948#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1958#L532-2 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; 1965#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1961#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1962#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1974#L511-1 assume !strspn_#t~short7; 1985#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 1977#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1978#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 1949#L510-5 strspn_#res := strspn_~l~0; 1950#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 1971#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 1966#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1968#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1983#L524-4 [2018-12-09 06:29:46,130 INFO L796 eck$LassoCheckResult]: Loop: 1983#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1951#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1952#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 1981#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 1983#L524-4 [2018-12-09 06:29:46,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2018-12-09 06:29:46,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:46,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2018-12-09 06:29:46,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:46,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2018-12-09 06:29:46,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:46,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-12-09 06:29:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:46,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 06:29:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 06:29:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 06:29:46,279 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-09 06:29:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:46,431 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-12-09 06:29:46,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 06:29:46,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2018-12-09 06:29:46,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 06:29:46,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2018-12-09 06:29:46,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-09 06:29:46,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-09 06:29:46,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-12-09 06:29:46,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:46,434 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-12-09 06:29:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-12-09 06:29:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2018-12-09 06:29:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 06:29:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-12-09 06:29:46,436 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-09 06:29:46,436 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-09 06:29:46,436 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 06:29:46,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-12-09 06:29:46,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:46,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:46,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:46,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:46,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:46,437 INFO L794 eck$LassoCheckResult]: Stem: 2157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2127#L-1 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; 2126#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2117#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 2118#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2128#L532-2 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; 2135#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2133#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2134#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2145#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2148#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2149#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 2139#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 2140#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2142#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 2119#L510-5 strspn_#res := strspn_~l~0; 2120#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2141#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 2136#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2137#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2152#L524-4 [2018-12-09 06:29:46,437 INFO L796 eck$LassoCheckResult]: Loop: 2152#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2121#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2122#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2150#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2152#L524-4 [2018-12-09 06:29:46,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2018-12-09 06:29:46,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:46,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:46,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:29:46,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/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-12-09 06:29:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:46,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:46,646 INFO L478 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 5 treesize of output 1 [2018-12-09 06:29:46,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,656 INFO L478 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-12-09 06:29:46,657 INFO L478 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-12-09 06:29:46,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:46,665 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-12-09 06:29:46,805 INFO L478 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-12-09 06:29:46,806 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:29:46,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 06:29:46,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:46,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-12-09 06:29:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:46,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:29:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-12-09 06:29:46,843 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:46,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2018-12-09 06:29:46,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:46,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:46,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 06:29:46,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-12-09 06:29:46,881 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-12-09 06:29:48,982 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-12-09 06:29:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:49,057 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-12-09 06:29:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 06:29:49,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-12-09 06:29:49,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:49,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2018-12-09 06:29:49,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-09 06:29:49,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-09 06:29:49,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2018-12-09 06:29:49,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:49,059 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-12-09 06:29:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2018-12-09 06:29:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2018-12-09 06:29:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 06:29:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-12-09 06:29:49,061 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-12-09 06:29:49,061 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-12-09 06:29:49,061 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 06:29:49,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2018-12-09 06:29:49,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:49,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:49,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:49,062 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] [2018-12-09 06:29:49,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:49,062 INFO L794 eck$LassoCheckResult]: Stem: 2398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2366#L-1 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; 2365#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2356#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 2357#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2367#L532-2 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; 2374#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2370#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2371#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2383#L511-1 assume !strspn_#t~short7; 2397#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2399#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2384#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2385#L511-1 assume !strspn_#t~short7; 2396#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2386#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2387#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2358#L510-5 strspn_#res := strspn_~l~0; 2359#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2380#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 2375#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2376#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2394#L524-4 [2018-12-09 06:29:49,062 INFO L796 eck$LassoCheckResult]: Loop: 2394#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2360#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2361#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2390#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2394#L524-4 [2018-12-09 06:29:49,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2018-12-09 06:29:49,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:49,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:29:49,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:29:49,079 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:49,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2018-12-09 06:29:49,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:49,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:49,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:29:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:29:49,109 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-12-09 06:29:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:49,114 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-12-09 06:29:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:29:49,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2018-12-09 06:29:49,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:49,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2018-12-09 06:29:49,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 06:29:49,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 06:29:49,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2018-12-09 06:29:49,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:49,115 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-09 06:29:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2018-12-09 06:29:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-09 06:29:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 06:29:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-09 06:29:49,117 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-09 06:29:49,117 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-09 06:29:49,117 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 06:29:49,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2018-12-09 06:29:49,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:49,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:49,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:49,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:49,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:49,117 INFO L794 eck$LassoCheckResult]: Stem: 2522#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2490#L-1 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; 2489#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2480#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 2481#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2491#L532-2 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; 2498#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2494#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2495#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2507#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2528#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2527#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2526#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2519#L511-1 assume !strspn_#t~short7; 2520#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2510#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2511#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2482#L510-5 strspn_#res := strspn_~l~0; 2483#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2504#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 2499#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2500#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2517#L524-4 [2018-12-09 06:29:49,117 INFO L796 eck$LassoCheckResult]: Loop: 2517#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2484#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2485#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2514#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2517#L524-4 [2018-12-09 06:29:49,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2018-12-09 06:29:49,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2018-12-09 06:29:49,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2018-12-09 06:29:49,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:49,974 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 226 [2018-12-09 06:29:50,190 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-12-09 06:29:50,193 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:50,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:50,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:50,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:50,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:50,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:50,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:50,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:50,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-12-09 06:29:50,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:50,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:50,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,805 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2018-12-09 06:29:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:50,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:51,136 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-12-09 06:29:51,588 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-09 06:29:51,630 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:51,630 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:51,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,650 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:51,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:51,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:51,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:51,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:51,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:51,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:51,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:51,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:51,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:51,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:51,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:51,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:51,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:51,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:51,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:51,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:51,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:51,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:51,703 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:29:51,703 INFO L444 ModelExtractionUtils]: 75 out of 82 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 06:29:51,703 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:51,703 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:51,704 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:51,704 INFO L520 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-12-09 06:29:51,874 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2018-12-09 06:29:51,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:51,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:51,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:51,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:51,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 06:29:51,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-12-09 06:29:51,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 84 states and 98 transitions. Complement of second has 5 states. [2018-12-09 06:29:51,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 06:29:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-09 06:29:51,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2018-12-09 06:29:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2018-12-09 06:29:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2018-12-09 06:29:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:51,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-12-09 06:29:51,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:51,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2018-12-09 06:29:51,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 06:29:51,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 06:29:51,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2018-12-09 06:29:51,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:51,922 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-12-09 06:29:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2018-12-09 06:29:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-12-09 06:29:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 06:29:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-09 06:29:51,924 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-09 06:29:51,924 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-09 06:29:51,924 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 06:29:51,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-12-09 06:29:51,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:51,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:51,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:51,925 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] [2018-12-09 06:29:51,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:51,925 INFO L794 eck$LassoCheckResult]: Stem: 2990#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2953#L-1 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; 2952#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2944#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 2945#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2954#L532-2 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; 2961#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2957#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2958#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2972#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2996#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2995#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2994#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2986#L511-1 assume !strspn_#t~short7; 2987#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 2976#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2977#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2946#L510-5 strspn_#res := strspn_~l~0; 2947#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2968#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 2962#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2963#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3003#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2997#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 2992#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 2955#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 2956#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2964#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2984#L524-4 [2018-12-09 06:29:51,925 INFO L796 eck$LassoCheckResult]: Loop: 2984#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2948#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2949#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2980#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2984#L524-4 [2018-12-09 06:29:51,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2018-12-09 06:29:51,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:51,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:51,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:51,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:51,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:29:52,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/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-12-09 06:29:52,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:52,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:52,110 INFO L478 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-12-09 06:29:52,111 INFO L478 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-12-09 06:29:52,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:52,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:52,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:52,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-09 06:29:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 06:29:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:29:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-09 06:29:52,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:52,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2018-12-09 06:29:52,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:52,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:52,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 06:29:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-09 06:29:52,172 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2018-12-09 06:29:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:52,499 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-12-09 06:29:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 06:29:52,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2018-12-09 06:29:52,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 06:29:52,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2018-12-09 06:29:52,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-09 06:29:52,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-09 06:29:52,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-12-09 06:29:52,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:52,502 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-12-09 06:29:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-12-09 06:29:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2018-12-09 06:29:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 06:29:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-12-09 06:29:52,505 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-09 06:29:52,505 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-09 06:29:52,505 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 06:29:52,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2018-12-09 06:29:52,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:52,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:52,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:52,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-12-09 06:29:52,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:52,506 INFO L794 eck$LassoCheckResult]: Stem: 3316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3283#L-1 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; 3282#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3274#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 3275#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3284#L532-2 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; 3291#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 3287#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 3288#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3300#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 3322#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 3321#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 3320#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3313#L511-1 assume !strspn_#t~short7; 3314#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 3304#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 3305#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 3276#L510-5 strspn_#res := strspn_~l~0; 3277#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 3298#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 3292#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3293#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3311#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3280#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3281#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 3309#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3312#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3323#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3317#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 3285#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 3286#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3294#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3310#L524-4 [2018-12-09 06:29:52,507 INFO L796 eck$LassoCheckResult]: Loop: 3310#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3278#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3279#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 3308#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3310#L524-4 [2018-12-09 06:29:52,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2018-12-09 06:29:52,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:52,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2018-12-09 06:29:52,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2018-12-09 06:29:52,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:53,552 WARN L180 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 255 [2018-12-09 06:29:53,753 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 06:29:53,755 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:53,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:53,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:53,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:53,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:53,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:53,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:53,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:53,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-12-09 06:29:53,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:53,756 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:53,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:53,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,295 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2018-12-09 06:29:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:54,582 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 06:29:54,923 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-09 06:29:55,132 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 06:29:55,194 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:55,194 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:55,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-12-09 06:29:55,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:55,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:55,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:55,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:55,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,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-12-09 06:29:55,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:55,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:55,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:55,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:55,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:55,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:55,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,202 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:55,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,203 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:55,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,206 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:55,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,207 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:55,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,213 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-09 06:29:55,213 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-09 06:29:55,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,223 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-12-09 06:29:55,224 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-09 06:29:55,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,276 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:55,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:55,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:55,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:55,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:55,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-12-09 06:29:55,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:55,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:55,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:55,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:55,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:55,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:55,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:55,346 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 06:29:55,346 INFO L444 ModelExtractionUtils]: 80 out of 88 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 06:29:55,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:55,347 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:29:55,347 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:55,347 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-12-09 06:29:55,525 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-12-09 06:29:55,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:29:55,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:55,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:55,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:55,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-09 06:29:55,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-09 06:29:55,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-12-09 06:29:55,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 06:29:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-12-09 06:29:55,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-09 06:29:55,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:55,747 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:29:55,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:55,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:55,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:55,867 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-09 06:29:55,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-09 06:29:55,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-12-09 06:29:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 06:29:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-12-09 06:29:55,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-09 06:29:55,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:55,956 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:29:55,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:55,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:56,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:56,097 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-09 06:29:56,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-09 06:29:56,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 133 states and 153 transitions. Complement of second has 15 states. [2018-12-09 06:29:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-09 06:29:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 06:29:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-12-09 06:29:56,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-09 06:29:56,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2018-12-09 06:29:56,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2018-12-09 06:29:56,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2018-12-09 06:29:56,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 06:29:56,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2018-12-09 06:29:56,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-09 06:29:56,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-09 06:29:56,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2018-12-09 06:29:56,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:56,253 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-12-09 06:29:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2018-12-09 06:29:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-12-09 06:29:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 06:29:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-12-09 06:29:56,255 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-12-09 06:29:56,255 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-12-09 06:29:56,255 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 06:29:56,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2018-12-09 06:29:56,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:56,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:56,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:56,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 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, 1] [2018-12-09 06:29:56,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:56,257 INFO L794 eck$LassoCheckResult]: Stem: 4296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4263#L-1 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; 4262#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4254#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 4255#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4264#L532-2 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; 4271#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4278#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4319#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4318#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4316#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 4314#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4313#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4310#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4279#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4269#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4270#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4282#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4306#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 4285#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4286#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4274#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4275#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4307#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 4256#L510-5 strspn_#res := strspn_~l~0; 4257#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4276#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 4272#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4273#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4291#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4297#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4342#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4341#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4340#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4338#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4298#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4299#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4304#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4289#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4290#L524-4 [2018-12-09 06:29:56,257 INFO L796 eck$LassoCheckResult]: Loop: 4290#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4258#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4259#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4287#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4290#L524-4 [2018-12-09 06:29:56,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2018-12-09 06:29:56,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:56,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:56,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:56,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 06:29:56,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:29:56,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff89ae93-b80a-46dd-93da-69d8a08b58a7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:29:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:56,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:56,443 INFO L478 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-12-09 06:29:56,444 INFO L478 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-12-09 06:29:56,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:56,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:56,448 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-12-09 06:29:56,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-12-09 06:29:56,702 INFO L478 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-12-09 06:29:56,703 INFO L478 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-12-09 06:29:56,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:29:56,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:56,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:29:56,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 06:29:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 06:29:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:29:56,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-12-09 06:29:56,731 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:29:56,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2018-12-09 06:29:56,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:56,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 06:29:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-12-09 06:29:56,772 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 27 states. [2018-12-09 06:29:57,341 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 06:29:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:29:57,429 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-12-09 06:29:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 06:29:57,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2018-12-09 06:29:57,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:57,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2018-12-09 06:29:57,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-09 06:29:57,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-09 06:29:57,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2018-12-09 06:29:57,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:57,431 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-12-09 06:29:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2018-12-09 06:29:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-09 06:29:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 06:29:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-12-09 06:29:57,432 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-12-09 06:29:57,432 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-12-09 06:29:57,432 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 06:29:57,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2018-12-09 06:29:57,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 06:29:57,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:57,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:57,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2018-12-09 06:29:57,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:29:57,433 INFO L794 eck$LassoCheckResult]: Stem: 4696#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4659#L-1 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; 4658#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4650#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);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; 4651#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4660#L532-2 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; 4667#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4675#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4746#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4745#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4744#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 4743#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4741#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4740#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4676#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4663#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4664#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4677#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4728#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 4727#L511-5 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, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 4726#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4693#L511-1 assume !strspn_#t~short7; 4694#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5;havoc strspn_#t~mem4; 4680#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4681#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 4652#L510-5 strspn_#res := strspn_~l~0; 4653#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4687#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;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; 4668#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4669#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4690#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4656#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4657#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4691#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4692#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4703#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4697#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4698#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4700#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4688#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4689#L524-4 [2018-12-09 06:29:57,433 INFO L796 eck$LassoCheckResult]: Loop: 4689#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4654#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4655#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4684#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4689#L524-4 [2018-12-09 06:29:57,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2018-12-09 06:29:57,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:57,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2018-12-09 06:29:57,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:57,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:57,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:57,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2018-12-09 06:29:57,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:57,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:57,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:29:57,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:58,760 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 384 DAG size of output: 282 [2018-12-09 06:29:58,983 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-09 06:29:58,985 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:58,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:58,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:58,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:58,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:58,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:58,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:58,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:58,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2018-12-09 06:29:58,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:58,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:58,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:58,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:58,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-12-09 06:29:58,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-12-09 06:29:58,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:58,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-12-09 06:29:58,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-12-09 06:29:58,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,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-12-09 06:29:59,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,645 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 159 [2018-12-09 06:29:59,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:30:00,378 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-09 06:30:00,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:30:00,616 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:30:00,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:30:00,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:30:00,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:30:00,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:30:00,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,633 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:30:00,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,637 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-09 06:30:00,637 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-09 06:30:00,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,646 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-12-09 06:30:00,646 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-09 06:30:00,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,712 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:30:00,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,713 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:30:00,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,720 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:30:00,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,721 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:30:00,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:30:00,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:30:00,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-12-09 06:30:00,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:30:00,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:30:00,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:30:00,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:30:00,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:30:00,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:30:00,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:30:00,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:30:00,756 INFO L444 ModelExtractionUtils]: 74 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 06:30:00,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:30:00,757 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:30:00,757 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:30:00,757 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-12-09 06:30:01,115 INFO L297 tatePredicateManager]: 68 out of 68 supporting invariants were superfluous and have been removed [2018-12-09 06:30:01,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 06:30:01,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:30:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:30:01,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 06:30:01,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-09 06:30:01,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-12-09 06:30:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:30:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 06:30:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-09 06:30:01,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-09 06:30:01,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:30:01,183 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:30:01,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:30:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:30:01,224 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-12-09 06:30:01,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-09 06:30:01,231 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-12-09 06:30:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:30:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 06:30:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-09 06:30:01,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-09 06:30:01,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:30:01,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 06:30:01,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:30:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:30:01,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:30:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:30:01,276 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-12-09 06:30:01,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-09 06:30:01,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 127 states and 148 transitions. Complement of second has 4 states. [2018-12-09 06:30:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 06:30:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 06:30:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-09 06:30:01,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-09 06:30:01,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:30:01,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-09 06:30:01,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:30:01,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2018-12-09 06:30:01,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:30:01,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2018-12-09 06:30:01,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:30:01,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 06:30:01,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 06:30:01,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:30:01,288 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 06:30:01,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:30:01,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:30:01,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 06:30:01,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 06:30:01 BoogieIcfgContainer [2018-12-09 06:30:01,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 06:30:01,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:30:01,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:30:01,294 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:30:01,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:37" (3/4) ... [2018-12-09 06:30:01,297 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 06:30:01,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:30:01,298 INFO L168 Benchmark]: Toolchain (without parser) took 24192.03 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 739.8 MB). Free memory was 950.6 MB in the beginning and 1.6 GB in the end (delta: -680.2 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-12-09 06:30:01,299 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:30:01,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 06:30:01,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:30:01,300 INFO L168 Benchmark]: Boogie Preprocessor took 17.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:30:01,300 INFO L168 Benchmark]: RCFGBuilder took 220.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:30:01,300 INFO L168 Benchmark]: BuchiAutomizer took 23644.21 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 634.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -580.4 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-09 06:30:01,301 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:30:01,303 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23644.21 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 634.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -580.4 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 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 16 terminating modules (9 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 5 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.6s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 18.4s. Construction of modules took 0.8s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 277 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 101 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 606 SDtfs, 1561 SDslu, 1214 SDs, 0 SdLazy, 1505 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI1 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp39 div107 bol100 ite100 ukn100 eq191 hnf85 smp96 dnf150 smp87 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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...