./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_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:38,516 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:51:38,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:51:38,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:51:38,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:51:38,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:51:38,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:51:38,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:51:38,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:51:38,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:51:38,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:51:38,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:51:38,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:51:38,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:51:38,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:51:38,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:51:38,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:51:38,530 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:51:38,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:51:38,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:51:38,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:51:38,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:51:38,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:51:38,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:51:38,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:51:38,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:51:38,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:51:38,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:51:38,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:51:38,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:51:38,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:51:38,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:51:38,537 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:51:38,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:51:38,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:51:38,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:51:38,538 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 17:51:38,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:51:38,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:51:38,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:51:38,547 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 17:51:38,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 17:51:38,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 17:51:38,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:51:38,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 17:51:38,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:51:38,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:51:38,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 17:51:38,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:51:38,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:51:38,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 17:51:38,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 17:51:38,550 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_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:38,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:51:38,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:51:38,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:51:38,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:51:38,576 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:51:38,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-12-01 17:51:38,611 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/data/b2f7b7ea7/75a33a56ecf2479e83c48384a29be71d/FLAG5bf3431e7 [2018-12-01 17:51:38,968 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:51:38,968 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-12-01 17:51:38,974 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/data/b2f7b7ea7/75a33a56ecf2479e83c48384a29be71d/FLAG5bf3431e7 [2018-12-01 17:51:38,982 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/bin-2019/uautomizer/data/b2f7b7ea7/75a33a56ecf2479e83c48384a29be71d [2018-12-01 17:51:38,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:51:38,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:51:38,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:51:38,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:51:38,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:51:38,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:51:38" (1/1) ... [2018-12-01 17:51:38,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:38, skipping insertion in model container [2018-12-01 17:51:38,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:51:38" (1/1) ... [2018-12-01 17:51:38,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:51:39,021 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:51:39,178 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:51:39,184 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:51:39,246 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:51:39,268 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:51:39,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39 WrapperNode [2018-12-01 17:51:39,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:51:39,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:51:39,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:51:39,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:51:39,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:51:39,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:51:39,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:51:39,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:51:39,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... [2018-12-01 17:51:39,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:51:39,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:51:39,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:51:39,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:51:39,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-01 17:51:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:51:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:51:39,545 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:51:39,545 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-01 17:51:39,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:51:39 BoogieIcfgContainer [2018-12-01 17:51:39,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:51:39,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 17:51:39,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 17:51:39,548 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 17:51:39,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:51:39,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 05:51:38" (1/3) ... [2018-12-01 17:51:39,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248579ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:51:39, skipping insertion in model container [2018-12-01 17:51:39,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:51:39,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:51:39" (2/3) ... [2018-12-01 17:51:39,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248579ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:51:39, skipping insertion in model container [2018-12-01 17:51:39,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:51:39,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:51:39" (3/3) ... [2018-12-01 17:51:39,551 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-12-01 17:51:39,584 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:51:39,584 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 17:51:39,584 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 17:51:39,584 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 17:51:39,584 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:51:39,584 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:51:39,584 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 17:51:39,585 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:51:39,585 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 17:51:39,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-12-01 17:51:39,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:39,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:39,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:39,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,611 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 17:51:39,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-12-01 17:51:39,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:39,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:39,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:39,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,617 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-01 17:51:39,618 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-01 17:51:39,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:39,621 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2018-12-01 17:51:39,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:39,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:39,719 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-01 17:51:39,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:39,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:51:39,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2018-12-01 17:51:39,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:39,731 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-01 17:51:39,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:51:39,733 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 17:51:39,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 17:51:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 17:51:39,746 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-12-01 17:51:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:39,752 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-01 17:51:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 17:51:39,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2018-12-01 17:51:39,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:39,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2018-12-01 17:51:39,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 17:51:39,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 17:51:39,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-01 17:51:39,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:51:39,761 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 17:51:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-01 17:51:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-01 17:51:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-01 17:51:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-01 17:51:39,782 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 17:51:39,782 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 17:51:39,782 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 17:51:39,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-12-01 17:51:39,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:39,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:39,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:39,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:39,784 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-01 17:51:39,784 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:39,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2018-12-01 17:51:39,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:39,823 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-01 17:51:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:51:39,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:39,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2018-12-01 17:51:39,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:39,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:39,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:51:39,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:51:39,991 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-01 17:51:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:40,011 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-01 17:51:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:51:40,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-12-01 17:51:40,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:40,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2018-12-01 17:51:40,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 17:51:40,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 17:51:40,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-12-01 17:51:40,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:51:40,014 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-01 17:51:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-12-01 17:51:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-01 17:51:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-01 17:51:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-01 17:51:40,016 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-01 17:51:40,016 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-01 17:51:40,016 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 17:51:40,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-12-01 17:51:40,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 17:51:40,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:40,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:40,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:40,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:40,017 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-01 17:51:40,017 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:40,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-12-01 17:51:40,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:40,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2018-12-01 17:51:40,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:40,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2018-12-01 17:51:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:40,503 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 142 [2018-12-01 17:51:40,643 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-01 17:51:40,651 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:40,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:40,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:40,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:40,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:40,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:40,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:40,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:40,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-12-01 17:51:40,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:40,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:40,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,668 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-01 17:51:40,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,670 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-01 17:51:40,673 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-01 17:51:40,674 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-01 17:51:40,675 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-01 17:51:40,676 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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51:40,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,693 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-01 17:51:40,694 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-01 17:51:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,701 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-01 17:51:40,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:40,963 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2018-12-01 17:51:41,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:41,331 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:41,334 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:41,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:41,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:41,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:41,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 17:51:41,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 17:51:41,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:41,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:41,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:41,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,450 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:41,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,451 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:41,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,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-01 17:51:41,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:41,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:41,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:41,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:41,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:41,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:41,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:41,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:41,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:41,489 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:51:41,489 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 17:51:41,491 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:41,492 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:41,492 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:41,492 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-01 17:51:41,530 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-12-01 17:51:41,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:41,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:41,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:41,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:41,608 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-01 17:51:41,610 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-01 17:51:41,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-01 17:51:41,675 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-01 17:51:41,675 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-01 17:51:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:51:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-01 17:51:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-01 17:51:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2018-12-01 17:51:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2018-12-01 17:51:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:41,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-12-01 17:51:41,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:41,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2018-12-01 17:51:41,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 17:51:41,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-01 17:51:41,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-12-01 17:51:41,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:41,679 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-01 17:51:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-12-01 17:51:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-01 17:51:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 17:51:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-01 17:51:41,681 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-01 17:51:41,681 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-01 17:51:41,681 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 17:51:41,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-12-01 17:51:41,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:41,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:41,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:41,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:41,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:41,681 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-01 17:51:41,682 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:41,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2018-12-01 17:51:41,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:41,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2018-12-01 17:51:41,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:41,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:41,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2018-12-01 17:51:41,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:41,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:42,120 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 155 [2018-12-01 17:51:42,270 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-01 17:51:42,271 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:42,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:42,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:42,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:42,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:42,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:42,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:42,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:42,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2018-12-01 17:51:42,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:42,272 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:42,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,280 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-01 17:51:42,281 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-01 17:51:42,282 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-01 17:51:42,283 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-01 17:51:42,284 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-01 17:51:42,285 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-01 17:51:42,285 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-01 17:51:42,287 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-01 17:51:42,288 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-01 17:51:42,289 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-01 17:51:42,289 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-01 17:51:42,290 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-01 17:51:42,538 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-12-01 17:51:42,586 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-01 17:51:42,587 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-01 17:51:42,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,593 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-01 17:51:42,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,596 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-01 17:51:42,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:42,598 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-01 17:51:42,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:43,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:43,008 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:43,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,044 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:43,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,045 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:43,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,062 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:43,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,064 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:43,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:43,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:43,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:43,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:43,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:43,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:43,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:43,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:43,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:43,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:43,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:43,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:43,104 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:43,111 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:51:43,111 INFO L444 ModelExtractionUtils]: 60 out of 64 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:51:43,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:43,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:43,113 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:43,113 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-01 17:51:43,167 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-12-01 17:51:43,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:43,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:43,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:43,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:43,221 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-01 17:51:43,222 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-01 17:51:43,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-01 17:51:43,284 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-01 17:51:43,285 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-01 17:51:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:51:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-12-01 17:51:43,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 17:51:43,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:43,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-01 17:51:43,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:43,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-01 17:51:43,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:43,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2018-12-01 17:51:43,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-12-01 17:51:43,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2018-12-01 17:51:43,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-01 17:51:43,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-01 17:51:43,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2018-12-01 17:51:43,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:43,288 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-12-01 17:51:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2018-12-01 17:51:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-12-01 17:51:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 17:51:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-12-01 17:51:43,290 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-12-01 17:51:43,291 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-12-01 17:51:43,291 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 17:51:43,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-12-01 17:51:43,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:43,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:43,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:43,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:43,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:43,292 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-01 17:51:43,292 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-01 17:51:43,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2018-12-01 17:51:43,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:43,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:43,390 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-01 17:51:43,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:43,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 17:51:43,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:43,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2018-12-01 17:51:43,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:51:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:51:43,435 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2018-12-01 17:51:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:43,612 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-12-01 17:51:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:51:43,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-12-01 17:51:43,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:43,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-12-01 17:51:43,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-01 17:51:43,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-01 17:51:43,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-12-01 17:51:43,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:43,614 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-12-01 17:51:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-12-01 17:51:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-12-01 17:51:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 17:51:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-12-01 17:51:43,616 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-01 17:51:43,616 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-01 17:51:43,616 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 17:51:43,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-12-01 17:51:43,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:43,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:43,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:43,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:43,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:43,617 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:43,617 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2018-12-01 17:51:43,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:43,652 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-01 17:51:43,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:43,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:51:43,652 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:43,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2018-12-01 17:51:43,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:43,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:51:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:51:43,720 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-12-01 17:51:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:43,752 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-12-01 17:51:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:51:43,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 91 transitions. [2018-12-01 17:51:43,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 17:51:43,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 87 transitions. [2018-12-01 17:51:43,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-01 17:51:43,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-01 17:51:43,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-12-01 17:51:43,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:43,755 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-01 17:51:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-12-01 17:51:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-12-01 17:51:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 17:51:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-12-01 17:51:43,758 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-01 17:51:43,758 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-01 17:51:43,758 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 17:51:43,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2018-12-01 17:51:43,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-01 17:51:43,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:43,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:43,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:43,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:51:43,759 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:43,759 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-01 17:51:43,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2018-12-01 17:51:43,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2018-12-01 17:51:43,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2018-12-01 17:51:43,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:44,454 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 196 [2018-12-01 17:51:44,720 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-12-01 17:51:44,723 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:44,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:44,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:44,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:44,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:44,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:44,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:44,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:44,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration7_Lasso [2018-12-01 17:51:44,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:44,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:44,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-01 17:51:44,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-01 17:51:44,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-01 17:51:44,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-01 17:51:44,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-01 17:51:44,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-01 17:51:44,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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51: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-01 17:51:45,142 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2018-12-01 17:51:45,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-01 17:51:45,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,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-01 17:51:45,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-01 17:51:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:45,706 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:45,706 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:45,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-01 17:51:45,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:45,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:45,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,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-01 17:51:45,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:45,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51: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-01 17:51:45,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,739 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:45,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:45,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:45,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 17:51:45,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,744 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 17:51:45,744 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 17:51:45,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51: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-01 17:51:45,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:45,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:45,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:45,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:45,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:45,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:45,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:45,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:45,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:45,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:45,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:45,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:45,795 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 17:51:45,795 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 17:51:45,796 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:45,796 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:45,796 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:45,797 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-12-01 17:51:45,867 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2018-12-01 17:51:45,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:45,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:45,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:45,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:45,903 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-01 17:51:45,903 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-01 17:51:45,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 64 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-12-01 17:51:45,915 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-01 17:51:45,915 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-01 17:51:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:51:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-12-01 17:51:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2018-12-01 17:51:45,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-01 17:51:45,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:45,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2018-12-01 17:51:45,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:45,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-12-01 17:51:45,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 17:51:45,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 72 transitions. [2018-12-01 17:51:45,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 17:51:45,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-01 17:51:45,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2018-12-01 17:51:45,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:45,917 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-01 17:51:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2018-12-01 17:51:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-01 17:51:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-01 17:51:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-12-01 17:51:45,919 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-01 17:51:45,919 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-12-01 17:51:45,919 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 17:51:45,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-12-01 17:51:45,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 17:51:45,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:45,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:45,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:51:45,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:45,920 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:45,920 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:45,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:45,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2018-12-01 17:51:45,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:45,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:45,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:45,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:45,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2018-12-01 17:51:45,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:45,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:45,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2018-12-01 17:51:45,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:45,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:46,593 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 186 [2018-12-01 17:51:46,810 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-01 17:51:46,812 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:46,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:46,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:46,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:46,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:46,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:46,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:46,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:46,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-12-01 17:51:46,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:46,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:46,815 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-01 17:51:46,817 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-01 17:51:46,818 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-01 17:51:46,819 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-01 17:51:46,820 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-01 17:51:46,821 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-01 17:51:46,823 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-01 17:51:46,824 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-01 17:51:46,825 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-01 17:51:46,826 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-01 17:51:47,164 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-12-01 17:51:47,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:47,249 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-01 17:51:47,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-01 17:51:47,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-01 17:51:47,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-01 17:51:47,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-01 17:51:47,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-01 17:51:47,654 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:47,654 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:47,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,670 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-01 17:51:47,670 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-01 17:51:47,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,673 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-12-01 17:51:47,673 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-01 17:51:47,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,694 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:47,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:47,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:47,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:47,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:47,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,707 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:47,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,707 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:47,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,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-01 17:51:47,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,711 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:47,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,711 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:47,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:47,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:47,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:47,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:47,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:47,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:47,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:47,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:47,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:47,727 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:47,736 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:51:47,736 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:51:47,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:47,737 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:47,737 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:47,737 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-12-01 17:51:47,821 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-12-01 17:51:47,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:47,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:47,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:47,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:47,880 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-01 17:51:47,880 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-01 17:51:47,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-01 17:51:47,923 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-01 17:51:47,924 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-01 17:51:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:51:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-01 17:51:47,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-01 17:51:47,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:47,924 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:51:47,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:47,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:47,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:47,975 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-01 17:51:47,976 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-01 17:51:47,976 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-01 17:51:48,012 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-01 17:51:48,012 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-01 17:51:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:51:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-01 17:51:48,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-01 17:51:48,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:48,012 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:51:48,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:48,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:48,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:48,066 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-01 17:51:48,066 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-01 17:51:48,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-01 17:51:48,104 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-01 17:51:48,104 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-01 17:51:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:51:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-01 17:51:48,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-01 17:51:48,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:48,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-01 17:51:48,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:48,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-01 17:51:48,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:48,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2018-12-01 17:51:48,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:48,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2018-12-01 17:51:48,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 17:51:48,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 17:51:48,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2018-12-01 17:51:48,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:48,108 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2018-12-01 17:51:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2018-12-01 17:51:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-12-01 17:51:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-01 17:51:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-12-01 17:51:48,110 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-01 17:51:48,110 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-01 17:51:48,110 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 17:51:48,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-12-01 17:51:48,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:48,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:48,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:48,111 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-01 17:51:48,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:48,111 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:48,111 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-01 17:51:48,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2018-12-01 17:51:48,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2018-12-01 17:51:48,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:48,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:48,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2018-12-01 17:51:48,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:48,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:48,254 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-01 17:51:48,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:48,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 17:51:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:51:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:51:48,279 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-01 17:51:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:48,419 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-12-01 17:51:48,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:51:48,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2018-12-01 17:51:48,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 17:51:48,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2018-12-01 17:51:48,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-01 17:51:48,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-01 17:51:48,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-12-01 17:51:48,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:48,421 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-12-01 17:51:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-12-01 17:51:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2018-12-01 17:51:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-01 17:51:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-12-01 17:51:48,423 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-01 17:51:48,423 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-01 17:51:48,423 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 17:51:48,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-12-01 17:51:48,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:48,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:48,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:48,424 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-01 17:51:48,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:48,424 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:48,424 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-01 17:51:48,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2018-12-01 17:51:48,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:48,580 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-01 17:51:48,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:51:48,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:48,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:48,621 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-01 17:51:48,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:48,628 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-01 17:51:48,630 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-01 17:51:48,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:48,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:51:48,634 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-01 17:51:48,634 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-12-01 17:51:48,834 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-01 17:51:48,836 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:51:48,837 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-01 17:51:48,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:48,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:51:48,850 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-01 17:51:48,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-12-01 17:51:48,861 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-01 17:51:48,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:51:48,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-12-01 17:51:48,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:48,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2018-12-01 17:51:48,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:48,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 17:51:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:51:48,905 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-12-01 17:51:50,126 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-01 17:51:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:50,258 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-12-01 17:51:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 17:51:50,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-12-01 17:51:50,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:50,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2018-12-01 17:51:50,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-01 17:51:50,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-01 17:51:50,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2018-12-01 17:51:50,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:50,260 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-12-01 17:51:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2018-12-01 17:51:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2018-12-01 17:51:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 17:51:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-12-01 17:51:50,262 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-12-01 17:51:50,262 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-12-01 17:51:50,262 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 17:51:50,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2018-12-01 17:51:50,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:50,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:50,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:50,263 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-01 17:51:50,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:50,264 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:50,264 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-01 17:51:50,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2018-12-01 17:51:50,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:50,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:50,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:50,287 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-01 17:51:50,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:51:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:51:50,287 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:50,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2018-12-01 17:51:50,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:51:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:51:50,320 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-12-01 17:51:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:50,325 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-12-01 17:51:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:51:50,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2018-12-01 17:51:50,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:50,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2018-12-01 17:51:50,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 17:51:50,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 17:51:50,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2018-12-01 17:51:50,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:50,327 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-01 17:51:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2018-12-01 17:51:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-01 17:51:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 17:51:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-01 17:51:50,329 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-01 17:51:50,329 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-01 17:51:50,329 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 17:51:50,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2018-12-01 17:51:50,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:50,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:50,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:50,330 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-01 17:51:50,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:50,330 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:50,330 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-01 17:51:50,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2018-12-01 17:51:50,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2018-12-01 17:51:50,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2018-12-01 17:51:50,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:50,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:51,167 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 226 [2018-12-01 17:51:51,379 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-12-01 17:51:51,380 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:51,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:51,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:51,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:51,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:51,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:51,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:51,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:51,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-12-01 17:51:51,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:51,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,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-01 17:51:51,392 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-01 17:51:51,393 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-01 17:51:51,394 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-01 17:51:51,394 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-01 17:51:51,395 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-01 17:51:52,028 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2018-12-01 17:51:52,110 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-01 17:51:52,112 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-01 17:51:52,113 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-01 17:51:52,114 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-01 17:51:52,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,127 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-01 17:51:52,127 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-01 17:51:52,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:51:52,129 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-01 17:51:52,130 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-01 17:51:52,131 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-01 17:51:52,132 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-01 17:51:52,133 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-01 17:51:52,133 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-01 17:51:52,134 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-01 17:51:52,136 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-01 17:51:52,137 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-01 17:51:52,138 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-01 17:51:52,325 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-12-01 17:51:52,773 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-01 17:51:52,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:52,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:52,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,834 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:52,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:52,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:52,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:52,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:52,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:52,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:52,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:52,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:52,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:52,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:52,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:52,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:52,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:52,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:52,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:52,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:52,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:52,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:52,874 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:52,890 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:51:52,890 INFO L444 ModelExtractionUtils]: 75 out of 82 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 17:51:52,890 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:52,891 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:52,891 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:52,891 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-01 17:51:53,059 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2018-12-01 17:51:53,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:53,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:53,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:53,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:53,099 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-01 17:51:53,100 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-01 17:51:53,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-12-01 17:51:53,109 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-01 17:51:53,110 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-01 17:51:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:51:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-01 17:51:53,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2018-12-01 17:51:53,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:53,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2018-12-01 17:51:53,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:53,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2018-12-01 17:51:53,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:53,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-12-01 17:51:53,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:53,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2018-12-01 17:51:53,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 17:51:53,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 17:51:53,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2018-12-01 17:51:53,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:53,112 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-12-01 17:51:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2018-12-01 17:51:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-12-01 17:51:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-01 17:51:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-01 17:51:53,113 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-01 17:51:53,113 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-01 17:51:53,113 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 17:51:53,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-12-01 17:51:53,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:53,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:53,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:53,114 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-01 17:51:53,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:53,114 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:53,114 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-01 17:51:53,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2018-12-01 17:51:53,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:53,188 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-01 17:51:53,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:51:53,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:53,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:53,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:53,269 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-01 17:51:53,271 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-01 17:51:53,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:53,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:51:53,272 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-01 17:51:53,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-01 17:51:53,274 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-01 17:51:53,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:51:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-01 17:51:53,289 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:53,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2018-12-01 17:51:53,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:53,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:51:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:51:53,331 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2018-12-01 17:51:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:53,628 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-12-01 17:51:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 17:51:53,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2018-12-01 17:51:53,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 17:51:53,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2018-12-01 17:51:53,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-01 17:51:53,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-01 17:51:53,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-12-01 17:51:53,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:53,631 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-12-01 17:51:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-12-01 17:51:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2018-12-01 17:51:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-01 17:51:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-12-01 17:51:53,634 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-01 17:51:53,634 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-01 17:51:53,634 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-01 17:51:53,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2018-12-01 17:51:53,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:53,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:53,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:53,635 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-01 17:51:53,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:53,636 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:53,636 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-01 17:51:53,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2018-12-01 17:51:53,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:53,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2018-12-01 17:51:53,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:53,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:53,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:53,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2018-12-01 17:51:53,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:53,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:53,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:53,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:54,630 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 255 [2018-12-01 17:51:54,829 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-01 17:51:54,830 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:51:54,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:51:54,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:51:54,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:51:54,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:51:54,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:51:54,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:51:54,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:51:54,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-12-01 17:51:54,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:51:54,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:51:54,833 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-01 17:51:54,834 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-01 17:51:55,382 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2018-12-01 17:51:55,452 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-01 17:51:55,453 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-01 17:51:55,454 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-01 17:51:55,455 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-01 17:51:55,456 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-01 17:51:55,457 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-01 17:51:55,458 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-01 17:51:55,458 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-01 17:51:55,459 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-01 17:51:55,460 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-01 17:51:55,461 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-01 17:51:55,461 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-01 17:51:55,462 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-01 17:51:55,464 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-01 17:51:55,465 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-01 17:51:55,465 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-01 17:51:55,466 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-01 17:51:55,467 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-01 17:51:55,468 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-01 17:51:55,469 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-01 17:51:55,469 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-01 17:51:55,470 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-01 17:51:55,472 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-01 17:51:55,474 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-01 17:51:55,475 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-01 17:51:55,475 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-01 17:51:55,476 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-01 17:51:55,477 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-01 17:51:55,479 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-01 17:51:55,479 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-01 17:51:55,480 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-01 17:51:55,481 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-01 17:51:55,482 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-01 17:51:55,482 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-01 17:51:55,483 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-01 17:51:55,486 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-01 17:51:55,487 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-01 17:51:55,679 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-01 17:51:56,026 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-01 17:51:56,219 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-01 17:51:56,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:51:56,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:51:56,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:56,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:56,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:56,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:56,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:56,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:56,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:56,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:56,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:56,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:56,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:56,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:51:56,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:51:56,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:51:56,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:56,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,291 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:56,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,291 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:56,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:56,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,294 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:56,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,295 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:56,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:51:56,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,301 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-01 17:51:56,301 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-01 17:51:56,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,311 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-12-01 17:51:56,312 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-01 17:51:56,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:56,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:51:56,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,366 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:51:56,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:56,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:56,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:51:56,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:51:56,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:51:56,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:51:56,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:51:56,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:51:56,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:51:56,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:51:56,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:51:56,441 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-01 17:51:56,442 INFO L444 ModelExtractionUtils]: 80 out of 88 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 17:51:56,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:51:56,442 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:51:56,442 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:51:56,442 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-01 17:51:56,591 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-12-01 17:51:56,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:51:56,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:56,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:56,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:56,708 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-01 17:51:56,709 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-01 17:51:56,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-01 17:51:56,803 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-01 17:51:56,804 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-01 17:51:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:51:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-12-01 17:51:56,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-01 17:51:56,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:56,804 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:51:56,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:56,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:56,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:56,926 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-01 17:51:56,926 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-01 17:51:56,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-01 17:51:57,012 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-01 17:51:57,012 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-01 17:51:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:51:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-12-01 17:51:57,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-01 17:51:57,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:57,013 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:51:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:57,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:57,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:57,128 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-01 17:51:57,128 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-01 17:51:57,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-12-01 17:51:57,279 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-01 17:51:57,280 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-01 17:51:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:51:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-12-01 17:51:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-01 17:51:57,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2018-12-01 17:51:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2018-12-01 17:51:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:51:57,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2018-12-01 17:51:57,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 17:51:57,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2018-12-01 17:51:57,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-01 17:51:57,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-01 17:51:57,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2018-12-01 17:51:57,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:57,283 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-12-01 17:51:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2018-12-01 17:51:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-12-01 17:51:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-01 17:51:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-12-01 17:51:57,285 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-12-01 17:51:57,285 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-12-01 17:51:57,285 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-01 17:51:57,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2018-12-01 17:51:57,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:57,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:57,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:57,286 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-01 17:51:57,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:57,287 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:57,287 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-01 17:51:57,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2018-12-01 17:51:57,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:57,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:57,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:57,444 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-01 17:51:57,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:51:57,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_159c6397-231a-4f13-88e2-7b62bd561a0c/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-01 17:51:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:51:57,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:51:57,483 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-01 17:51:57,484 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-01 17:51:57,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:51:57,491 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-01 17:51:57,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-12-01 17:51:57,739 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-01 17:51:57,740 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-01 17:51:57,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:51:57,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:51:57,741 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-01 17:51:57,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-01 17:51:57,751 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-01 17:51:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:51:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-12-01 17:51:57,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:51:57,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2018-12-01 17:51:57,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:57,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:57,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:57,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:57,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 17:51:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-12-01 17:51:57,799 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 27 states. [2018-12-01 17:51:58,361 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-01 17:51:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:51:58,462 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-12-01 17:51:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:51:58,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2018-12-01 17:51:58,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:58,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2018-12-01 17:51:58,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-01 17:51:58,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-01 17:51:58,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2018-12-01 17:51:58,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:51:58,464 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-12-01 17:51:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2018-12-01 17:51:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-01 17:51:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-01 17:51:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-12-01 17:51:58,466 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-12-01 17:51:58,466 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-12-01 17:51:58,466 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-01 17:51:58,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2018-12-01 17:51:58,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 17:51:58,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:51:58,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:51:58,467 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-01 17:51:58,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:51:58,467 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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~mem5;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7; 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-01 17:51:58,467 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-01 17:51:58,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2018-12-01 17:51:58,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:58,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:58,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2018-12-01 17:51:58,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:51:58,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:58,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:51:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2018-12-01 17:51:58,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:51:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:51:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:51:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:51:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:51:59,817 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 384 DAG size of output: 282 [2018-12-01 17:52:00,054 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-01 17:52:00,056 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:52:00,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:52:00,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:52:00,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:52:00,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:52:00,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:52:00,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:52:00,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:52:00,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2018-12-01 17:52:00,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:52:00,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:52:00,059 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-01 17:52:00,060 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-01 17:52:00,061 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-01 17:52:00,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:52:00,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:52:00,063 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-01 17:52:00,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:52:00,067 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-01 17:52:00,067 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-01 17:52:00,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:52:00,069 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-01 17:52:00,070 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-01 17:52:00,070 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-01 17:52:00,071 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-01 17:52:00,071 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-01 17:52:00,072 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-01 17:52:00,073 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-01 17:52:00,073 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-01 17:52:00,733 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 159 [2018-12-01 17:52:00,825 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-01 17:52:00,825 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-01 17:52:00,827 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-01 17:52:00,827 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-01 17:52:00,828 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-01 17:52:00,829 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-01 17:52:00,829 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-01 17:52:00,830 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-01 17:52:00,831 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-01 17:52:00,832 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-01 17:52:00,833 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-01 17:52:00,834 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-01 17:52:00,835 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-01 17:52:00,836 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-01 17:52:00,836 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-01 17:52:00,837 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-01 17:52:00,838 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-01 17:52:00,839 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-01 17:52:00,840 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-01 17:52:00,840 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-01 17:52:00,841 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-01 17:52:01,497 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-01 17:52:01,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:52:01,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:52:01,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-01 17:52:01,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,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-01 17:52:01,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:52:01,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:52:01,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:52:01,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:52:01,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,757 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:52:01,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,761 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-01 17:52:01,761 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-01 17:52:01,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,771 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-12-01 17:52:01,772 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-01 17:52:01,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:52:01,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,826 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:52:01,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,827 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:52:01,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,832 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:52:01,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:52:01,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:52:01,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:52:01,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:52:01,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:52:01,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:52:01,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:52:01,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:52:01,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:52:01,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:52:01,859 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:52:01,859 INFO L444 ModelExtractionUtils]: 74 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:52:01,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:52:01,859 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:52:01,860 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:52:01,860 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-01 17:52:02,146 INFO L297 tatePredicateManager]: 68 out of 68 supporting invariants were superfluous and have been removed [2018-12-01 17:52:02,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 17:52:02,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:52:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,191 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-01 17:52:02,192 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-01 17:52:02,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-01 17:52:02,200 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-01 17:52:02,200 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-01 17:52:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:52:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-01 17:52:02,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-01 17:52:02,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:52:02,200 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:52:02,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:52:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,237 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-01 17:52:02,237 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-01 17:52:02,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-01 17:52:02,247 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-01 17:52:02,247 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-01 17:52:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:52:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-12-01 17:52:02,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-01 17:52:02,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:52:02,248 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:52:02,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:52:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:52:02,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:52:02,285 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-01 17:52:02,285 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-01 17:52:02,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-12-01 17:52:02,293 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-01 17:52:02,293 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-01 17:52:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:52:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-01 17:52:02,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-01 17:52:02,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:52:02,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-01 17:52:02,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:52:02,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2018-12-01 17:52:02,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:52:02,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2018-12-01 17:52:02,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:52:02,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 17:52:02,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 17:52:02,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:52:02,295 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-01 17:52:02,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 17:52:02,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:52:02,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 17:52:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 05:52:02 BoogieIcfgContainer [2018-12-01 17:52:02,299 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 17:52:02,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:52:02,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:52:02,300 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:52:02,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:51:39" (3/4) ... [2018-12-01 17:52:02,302 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:52:02,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:52:02,303 INFO L168 Benchmark]: Toolchain (without parser) took 23318.56 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 668.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 471.0 MB. Max. memory is 11.5 GB. [2018-12-01 17:52:02,303 INFO L168 Benchmark]: CDTParser took 0.10 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-01 17:52:02,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-01 17:52:02,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:52:02,304 INFO L168 Benchmark]: Boogie Preprocessor took 18.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:52:02,304 INFO L168 Benchmark]: RCFGBuilder took 229.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:52:02,304 INFO L168 Benchmark]: BuchiAutomizer took 22753.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 520.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.4 MB). Peak memory consumption was 472.7 MB. Max. memory is 11.5 GB. [2018-12-01 17:52:02,305 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:52:02,306 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.10 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 283.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22753.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 520.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.4 MB). Peak memory consumption was 472.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 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 unknown-#length-unknown[s] + -1 * 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 unknown-#length-unknown[__builtin_alloca (delim_len)] + -1 * a 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 22.7s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 18.3s. Construction of modules took 0.7s. Büchi inclusion checks took 3.4s. 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.7s 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: 63ms 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...