./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/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_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/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-5842f4b [2018-11-18 09:18:09,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:18:09,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:18:09,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:18:09,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:18:09,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:18:09,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:18:09,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:18:09,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:18:09,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:18:09,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:18:09,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:18:09,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:18:09,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:18:09,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:18:09,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:18:09,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:18:09,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:18:09,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:18:09,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:18:09,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:18:09,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:18:09,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:18:09,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:18:09,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:18:09,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:18:09,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:18:09,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:18:09,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:18:09,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:18:09,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:18:09,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:18:09,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:18:09,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:18:09,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:18:09,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:18:09,931 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:18:09,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:18:09,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:18:09,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:18:09,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:18:09,944 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:18:09,944 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:18:09,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:18:09,945 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:18:09,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:18:09,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:18:09,946 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:18:09,947 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:18:09,947 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_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1697f909ede7c89de56057e54b84d7ae7cf0bcac [2018-11-18 09:18:09,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:18:09,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:18:09,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:18:09,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:18:09,987 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:18:09,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-18 09:18:10,026 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/data/db7d80f3f/3b8cb3711af744d4a57c4a49f528f320/FLAG72dc22ffd [2018-11-18 09:18:10,401 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:18:10,401 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-18 09:18:10,410 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/data/db7d80f3f/3b8cb3711af744d4a57c4a49f528f320/FLAG72dc22ffd [2018-11-18 09:18:10,785 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/data/db7d80f3f/3b8cb3711af744d4a57c4a49f528f320 [2018-11-18 09:18:10,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:18:10,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:18:10,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:18:10,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:18:10,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:18:10,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:18:10" (1/1) ... [2018-11-18 09:18:10,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a782c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:10, skipping insertion in model container [2018-11-18 09:18:10,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:18:10" (1/1) ... [2018-11-18 09:18:10,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:18:10,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:18:11,024 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:18:11,032 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:18:11,064 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:18:11,113 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:18:11,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11 WrapperNode [2018-11-18 09:18:11,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:18:11,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:18:11,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:18:11,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:18:11,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:18:11,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:18:11,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:18:11,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:18:11,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... [2018-11-18 09:18:11,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:18:11,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:18:11,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:18:11,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:18:11,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:18:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:18:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:18:11,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:18:11,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:11 BoogieIcfgContainer [2018-11-18 09:18:11,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:18:11,630 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:18:11,630 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:18:11,632 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:18:11,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:11,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:18:10" (1/3) ... [2018-11-18 09:18:11,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658e1001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:18:11, skipping insertion in model container [2018-11-18 09:18:11,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:11,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:11" (2/3) ... [2018-11-18 09:18:11,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658e1001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:18:11, skipping insertion in model container [2018-11-18 09:18:11,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:11,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:11" (3/3) ... [2018-11-18 09:18:11,635 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-11-18 09:18:11,679 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:18:11,679 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:18:11,680 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:18:11,680 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:18:11,680 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:18:11,680 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:18:11,680 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:18:11,680 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:18:11,680 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:18:11,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-18 09:18:11,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:11,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:11,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:11,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,710 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:18:11,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-18 09:18:11,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:11,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:11,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:11,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,718 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 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 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 20#L510-4true [2018-11-18 09:18:11,719 INFO L796 eck$LassoCheckResult]: Loop: 20#L510-4true assume true;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-11-18 09:18:11,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:11,724 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2018-11-18 09:18:11,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:11,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:11,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:11,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:18:11,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2018-11-18 09:18:11,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:11,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:18:11,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:18:11,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:18:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:18:11,886 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 09:18:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:11,893 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-18 09:18:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:18:11,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2018-11-18 09:18:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:11,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2018-11-18 09:18:11,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 09:18:11,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 09:18:11,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-18 09:18:11,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:11,903 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 09:18:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-18 09:18:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 09:18:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:18:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-18 09:18:11,929 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 09:18:11,929 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 09:18:11,929 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:18:11,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-18 09:18:11,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:11,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:11,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:11,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:11,931 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 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 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 92#L510-4 [2018-11-18 09:18:11,931 INFO L796 eck$LassoCheckResult]: Loop: 92#L510-4 assume true;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 assume true;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~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 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-11-18 09:18:11,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2018-11-18 09:18:11,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:11,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:11,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:18:11,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:11,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2018-11-18 09:18:11,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:11,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,134 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-18 09:18:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:18:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:18:12,176 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 09:18:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:12,209 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-18 09:18:12,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:18:12,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-18 09:18:12,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:12,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2018-11-18 09:18:12,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 09:18:12,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 09:18:12,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-18 09:18:12,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:12,212 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 09:18:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-18 09:18:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 09:18:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:18:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-18 09:18:12,214 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 09:18:12,214 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 09:18:12,214 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:18:12,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-18 09:18:12,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 09:18:12,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:12,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:12,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:12,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:12,215 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 140#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 148#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 153#L510-4 [2018-11-18 09:18:12,216 INFO L796 eck$LassoCheckResult]: Loop: 153#L510-4 assume true;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 assume true;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~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 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-11-18 09:18:12,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-11-18 09:18:12,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:12,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2018-11-18 09:18:12,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:12,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:12,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:12,259 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2018-11-18 09:18:12,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:12,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:12,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:12,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:12,423 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-18 09:18:12,816 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2018-11-18 09:18:12,983 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-18 09:18:12,992 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:12,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:12,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:12,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:12,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:12,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:12,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:12,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:12,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-11-18 09:18:12,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:12,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:13,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,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-11-18 09:18:13,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,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-11-18 09:18:13,337 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-18 09:18:13,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:13,788 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:13,792 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:13,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,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-11-18 09:18:13,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:13,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:13,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:18:13,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:18:13,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:13,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,894 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:13,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,896 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:13,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,943 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:13,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,945 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:13,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:13,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:13,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:13,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:13,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:13,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:13,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:13,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:13,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:14,001 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:18:14,001 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:18:14,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:14,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:14,004 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:14,005 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1) = -1*ULTIMATE.start_strspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1 Supporting invariants [] [2018-11-18 09:18:14,041 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 09:18:14,049 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:14,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:14,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:14,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:14,153 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:18:14,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 09:18:14,218 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-11-18 09:18:14,219 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-11-18 09:18:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 09:18:14,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 09:18:14,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:14,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-18 09:18:14,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:14,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2018-11-18 09:18:14,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:14,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-18 09:18:14,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 09:18:14,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2018-11-18 09:18:14,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 09:18:14,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 09:18:14,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-18 09:18:14,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:14,226 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 09:18:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-18 09:18:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 09:18:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 09:18:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-18 09:18:14,228 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 09:18:14,228 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 09:18:14,228 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:18:14,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-18 09:18:14,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 09:18:14,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:14,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:14,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:14,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:14,230 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 336#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; 329#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 330#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 338#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 345#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 341#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; 342#L511-6 [2018-11-18 09:18:14,230 INFO L796 eck$LassoCheckResult]: Loop: 342#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 350#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; 358#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 361#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; 342#L511-6 [2018-11-18 09:18:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2018-11-18 09:18:14,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2018-11-18 09:18:14,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:14,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2018-11-18 09:18:14,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:14,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:14,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:14,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:14,718 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 146 [2018-11-18 09:18:14,842 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-18 09:18:14,843 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:14,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:14,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:14,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:14,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:14,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:14,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:14,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:14,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2018-11-18 09:18:14,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:14,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:14,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,166 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-18 09:18:15,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-11-18 09:18:15,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,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-11-18 09:18:15,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-11-18 09:18:15,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:15,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:15,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:15,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,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-11-18 09:18:15,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,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-11-18 09:18:15,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,710 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:15,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,711 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:15,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:15,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:15,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:15,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:15,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:15,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:15,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:15,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:15,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:15,775 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:18:15,775 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:18:15,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:15,776 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:15,776 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:15,777 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-11-18 09:18:15,841 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-18 09:18:15,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:15,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:15,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:15,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:15,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:18:15,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 09:18:16,014 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-11-18 09:18:16,015 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-11-18 09:18:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-18 09:18:16,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 09:18:16,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:16,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-18 09:18:16,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:16,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-18 09:18:16,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:16,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2018-11-18 09:18:16,019 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-18 09:18:16,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2018-11-18 09:18:16,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-18 09:18:16,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-18 09:18:16,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2018-11-18 09:18:16,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:16,021 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-11-18 09:18:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2018-11-18 09:18:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-11-18 09:18:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 09:18:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-11-18 09:18:16,027 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-18 09:18:16,027 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-18 09:18:16,027 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:18:16,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-11-18 09:18:16,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 09:18:16,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:16,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:16,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:16,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:16,029 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 623#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; 616#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 617#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 625#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 632#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 628#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 618#L510-5 strspn_#res := strspn_~l~0; 619#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 636#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 627#L523-4 [2018-11-18 09:18:16,029 INFO L796 eck$LassoCheckResult]: Loop: 627#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 633#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 647#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 620#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 621#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 626#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; 627#L523-4 [2018-11-18 09:18:16,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2018-11-18 09:18:16,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:16,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 09:18:16,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:16,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2018-11-18 09:18:16,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:16,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:18:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:18:16,201 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2018-11-18 09:18:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:16,340 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-18 09:18:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:18:16,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-11-18 09:18:16,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 09:18:16,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-11-18 09:18:16,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 09:18:16,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 09:18:16,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-11-18 09:18:16,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:16,344 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-11-18 09:18:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-11-18 09:18:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-11-18 09:18:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 09:18:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-18 09:18:16,346 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-18 09:18:16,346 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-18 09:18:16,347 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:18:16,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-11-18 09:18:16,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 09:18:16,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:16,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:16,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:16,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:18:16,352 INFO L794 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 755#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 754#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; 747#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 748#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 756#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 763#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 768#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; 786#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 785#L511-1 assume !strspn_#t~short7; 782#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 772#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 773#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 749#L510-5 strspn_#res := strspn_~l~0; 750#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 767#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 758#L523-4 [2018-11-18 09:18:16,352 INFO L796 eck$LassoCheckResult]: Loop: 758#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 764#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 777#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 751#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 752#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 757#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; 758#L523-4 [2018-11-18 09:18:16,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2018-11-18 09:18:16,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:16,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2018-11-18 09:18:16,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2018-11-18 09:18:16,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:17,033 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 187 [2018-11-18 09:18:17,222 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-11-18 09:18:17,223 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:17,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:17,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:17,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:17,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:17,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:17,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:17,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:17,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration6_Lasso [2018-11-18 09:18:17,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:17,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:17,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,652 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 137 [2018-11-18 09:18:17,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,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-11-18 09:18:17,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,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-11-18 09:18:17,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,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-11-18 09:18:17,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,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-11-18 09:18:17,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,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-11-18 09:18:17,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-11-18 09:18:17,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-11-18 09:18:17,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:17,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:18,270 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:18,270 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:18,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,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-11-18 09:18:18,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:18,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:18,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:18,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,306 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:18,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,307 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:18,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:18,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,331 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:18,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:18,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:18,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:18,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:18,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:18,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:18,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:18,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:18,364 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:18,383 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:18:18,383 INFO L444 ModelExtractionUtils]: 71 out of 76 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:18:18,383 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:18,384 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:18,384 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:18,384 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-18 09:18:18,483 INFO L297 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2018-11-18 09:18:18,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:18,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:18,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:18,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:18,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:18:18,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-18 09:18:18,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 57 states and 74 transitions. Complement of second has 6 states. [2018-11-18 09:18:18,606 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-11-18 09:18:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 09:18:18,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 09:18:18,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:18,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 09:18:18,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:18,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-18 09:18:18,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:18,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 74 transitions. [2018-11-18 09:18:18,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:18,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 72 transitions. [2018-11-18 09:18:18,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 09:18:18,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 09:18:18,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2018-11-18 09:18:18,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:18,609 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 09:18:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2018-11-18 09:18:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 09:18:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 09:18:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-18 09:18:18,611 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 09:18:18,612 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 09:18:18,612 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:18:18,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2018-11-18 09:18:18,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:18,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:18,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:18,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:18,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:18,614 INFO L794 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1068#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; 1059#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1060#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1070#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1077#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1084#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; 1112#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1098#L511-1 assume !strspn_#t~short7; 1099#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1091#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1092#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; 1081#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; 1082#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1085#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; 1104#L511-6 [2018-11-18 09:18:18,614 INFO L796 eck$LassoCheckResult]: Loop: 1104#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1107#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; 1106#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1103#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; 1104#L511-6 [2018-11-18 09:18:18,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2018-11-18 09:18:18,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:18,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:18,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:18,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:18:18,633 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:18,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2018-11-18 09:18:18,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:18,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:18,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:18,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:18:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:18:18,705 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 23 Second operand 5 states. [2018-11-18 09:18:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:18,737 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2018-11-18 09:18:18,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:18:18,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 107 transitions. [2018-11-18 09:18:18,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 09:18:18,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 103 transitions. [2018-11-18 09:18:18,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 09:18:18,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 09:18:18,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 103 transitions. [2018-11-18 09:18:18,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:18,740 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2018-11-18 09:18:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 103 transitions. [2018-11-18 09:18:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-11-18 09:18:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 09:18:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-11-18 09:18:18,743 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 09:18:18,743 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 09:18:18,743 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:18:18,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-11-18 09:18:18,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:18,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:18,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:18,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:18,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:18,745 INFO L794 eck$LassoCheckResult]: Stem: 1252#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1219#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; 1210#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1211#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1221#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1228#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1226#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; 1227#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1264#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; 1257#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1242#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1243#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; 1232#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; 1233#L510-4 assume true;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-11-18 09:18:18,745 INFO L796 eck$LassoCheckResult]: Loop: 1225#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1237#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; 1263#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1255#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-11-18 09:18:18,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2018-11-18 09:18:18,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:18,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:18,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:18,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2018-11-18 09:18:18,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2018-11-18 09:18:18,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:19,412 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 174 [2018-11-18 09:18:19,567 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-18 09:18:19,569 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:19,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:19,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:19,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:19,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:19,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:19,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:19,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:19,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-11-18 09:18:19,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:19,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:19,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,878 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118 [2018-11-18 09:18:19,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:19,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:20,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:20,378 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:20,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,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-11-18 09:18:20,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,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-11-18 09:18:20,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:20,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:20,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:20,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,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-11-18 09:18:20,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,404 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-18 09:18:20,404 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 09:18:20,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,410 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-18 09:18:20,411 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 09:18:20,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,446 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:20,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,447 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:20,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,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-11-18 09:18:20,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,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-11-18 09:18:20,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:20,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:20,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:20,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:20,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:20,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:20,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:20,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:20,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:20,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:20,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:20,501 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:18:20,501 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:18:20,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:20,502 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:20,502 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:20,502 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-11-18 09:18:20,630 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2018-11-18 09:18:20,632 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:20,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:18:20,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-18 09:18:20,741 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-11-18 09:18:20,741 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-11-18 09:18:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-18 09:18:20,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 09:18:20,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:20,742 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:20,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:20,799 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-11-18 09:18:20,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-18 09:18:20,840 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-11-18 09:18:20,840 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-11-18 09:18:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-18 09:18:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 09:18:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:20,840 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:20,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:20,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:20,908 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-11-18 09:18:20,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-18 09:18:20,950 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-11-18 09:18:20,950 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-11-18 09:18:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:18:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-18 09:18:20,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 09:18:20,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:20,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 09:18:20,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:20,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 09:18:20,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:20,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2018-11-18 09:18:20,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:20,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2018-11-18 09:18:20,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 09:18:20,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 09:18:20,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2018-11-18 09:18:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:20,955 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2018-11-18 09:18:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2018-11-18 09:18:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-11-18 09:18:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 09:18:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-18 09:18:20,959 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-18 09:18:20,959 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-18 09:18:20,960 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 09:18:20,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-18 09:18:20,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:20,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:20,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:20,960 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-11-18 09:18:20,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:20,961 INFO L794 eck$LassoCheckResult]: Stem: 1995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1964#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; 1955#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1956#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1966#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1973#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1969#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; 1970#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1981#L511-1 assume !strspn_#t~short7; 1993#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1985#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1986#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 1957#L510-5 strspn_#res := strspn_~l~0; 1958#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 1979#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1974#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1976#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1991#L524-4 [2018-11-18 09:18:20,961 INFO L796 eck$LassoCheckResult]: Loop: 1991#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1959#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); 1960#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 1989#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 1991#L524-4 [2018-11-18 09:18:20,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2018-11-18 09:18:20,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:20,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:20,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2018-11-18 09:18:20,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:20,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2018-11-18 09:18:20,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 09:18:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:18:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:18:21,125 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-18 09:18:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:21,262 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-18 09:18:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:18:21,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2018-11-18 09:18:21,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:21,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2018-11-18 09:18:21,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 09:18:21,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 09:18:21,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-11-18 09:18:21,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:21,265 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-18 09:18:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-11-18 09:18:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2018-11-18 09:18:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 09:18:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-18 09:18:21,269 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-18 09:18:21,269 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-18 09:18:21,269 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 09:18:21,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-11-18 09:18:21,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:21,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:21,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:21,270 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-11-18 09:18:21,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:21,270 INFO L794 eck$LassoCheckResult]: Stem: 2165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2134#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; 2125#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2126#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2136#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2143#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2141#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; 2142#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2153#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; 2170#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2156#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2157#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; 2147#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; 2148#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2150#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 2127#L510-5 strspn_#res := strspn_~l~0; 2128#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2149#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2144#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2146#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2160#L524-4 [2018-11-18 09:18:21,271 INFO L796 eck$LassoCheckResult]: Loop: 2160#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2129#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); 2130#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2158#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2160#L524-4 [2018-11-18 09:18:21,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2018-11-18 09:18:21,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:21,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:21,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:21,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:21,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:21,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:18:21,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:18:21,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:21,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:21,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 09:18:21,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-18 09:18:21,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 09:18:21,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,571 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-11-18 09:18:21,571 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-11-18 09:18:21,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 09:18:21,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 09:18:21,894 INFO L477 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-11-18 09:18:21,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:21,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-11-18 09:18:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:18:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-18 09:18:21,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:21,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2018-11-18 09:18:21,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:21,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 09:18:22,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-11-18 09:18:22,073 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-11-18 09:18:24,431 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-18 09:18:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:24,556 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-18 09:18:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:18:24,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-18 09:18:24,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:24,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2018-11-18 09:18:24,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 09:18:24,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 09:18:24,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2018-11-18 09:18:24,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:24,558 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-18 09:18:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2018-11-18 09:18:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2018-11-18 09:18:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:18:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-18 09:18:24,561 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-18 09:18:24,561 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-18 09:18:24,561 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 09:18:24,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2018-11-18 09:18:24,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:24,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:24,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:24,562 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-11-18 09:18:24,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:24,562 INFO L794 eck$LassoCheckResult]: Stem: 2406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2373#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; 2364#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2365#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2375#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2382#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2378#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; 2379#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2391#L511-1 assume !strspn_#t~short7; 2405#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2407#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; 2392#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2393#L511-1 assume !strspn_#t~short7; 2404#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2394#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2395#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2366#L510-5 strspn_#res := strspn_~l~0; 2367#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2388#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2383#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2385#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2402#L524-4 [2018-11-18 09:18:24,562 INFO L796 eck$LassoCheckResult]: Loop: 2402#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2368#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); 2369#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2398#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2402#L524-4 [2018-11-18 09:18:24,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2018-11-18 09:18:24,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:24,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:18:24,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:24,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2018-11-18 09:18:24,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:24,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:18:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:18:24,632 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-11-18 09:18:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:24,639 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-18 09:18:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:18:24,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2018-11-18 09:18:24,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:24,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2018-11-18 09:18:24,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 09:18:24,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 09:18:24,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2018-11-18 09:18:24,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:24,641 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-18 09:18:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2018-11-18 09:18:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-18 09:18:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:18:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-18 09:18:24,643 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-18 09:18:24,643 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-18 09:18:24,643 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 09:18:24,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2018-11-18 09:18:24,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:24,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:24,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:24,644 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-11-18 09:18:24,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:24,645 INFO L794 eck$LassoCheckResult]: Stem: 2530#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2497#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; 2488#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2489#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2499#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2506#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2502#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; 2503#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2515#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; 2536#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2535#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; 2534#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2527#L511-1 assume !strspn_#t~short7; 2528#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2518#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2519#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2490#L510-5 strspn_#res := strspn_~l~0; 2491#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2512#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2507#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2509#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2525#L524-4 [2018-11-18 09:18:24,645 INFO L796 eck$LassoCheckResult]: Loop: 2525#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2492#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); 2493#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2522#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2525#L524-4 [2018-11-18 09:18:24,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2018-11-18 09:18:24,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:24,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2018-11-18 09:18:24,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:24,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:24,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2018-11-18 09:18:24,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:24,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:25,519 WARN L180 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 214 [2018-11-18 09:18:25,751 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-11-18 09:18:25,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:25,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:25,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:25,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:25,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:25,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:25,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:25,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:25,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-11-18 09:18:25,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:25,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:25,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:25,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,327 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2018-11-18 09:18:26,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,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-11-18 09:18:26,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-11-18 09:18:26,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-11-18 09:18:26,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-11-18 09:18:26,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-11-18 09:18:26,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-11-18 09:18:26,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,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-11-18 09:18:26,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:26,802 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-18 09:18:27,052 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-18 09:18:27,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:27,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:27,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:27,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:27,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:27,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,256 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:27,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,257 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:27,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,281 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:27,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:27,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,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-11-18 09:18:27,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,290 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-18 09:18:27,290 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 09:18:27,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,298 INFO L402 nArgumentSynthesizer]: We have 88 Motzkin's Theorem applications. [2018-11-18 09:18:27,298 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 09:18:27,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:27,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,347 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:27,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:27,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:27,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:27,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:27,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:27,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:27,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:27,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:27,381 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:27,403 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:18:27,403 INFO L444 ModelExtractionUtils]: 76 out of 82 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 09:18:27,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:27,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:27,404 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:27,404 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-11-18 09:18:27,632 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2018-11-18 09:18:27,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:27,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:27,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:27,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:27,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:18:27,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-18 09:18:27,702 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-11-18 09:18:27,703 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-11-18 09:18:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:18:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-18 09:18:27,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 09:18:27,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:27,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-18 09:18:27,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:27,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-18 09:18:27,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:27,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-11-18 09:18:27,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:27,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2018-11-18 09:18:27,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 09:18:27,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 09:18:27,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2018-11-18 09:18:27,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:27,706 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-18 09:18:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2018-11-18 09:18:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-18 09:18:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 09:18:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-18 09:18:27,711 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-18 09:18:27,711 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-18 09:18:27,711 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 09:18:27,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-11-18 09:18:27,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:27,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:27,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:27,712 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-11-18 09:18:27,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:27,712 INFO L794 eck$LassoCheckResult]: Stem: 2994#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2957#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2956#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; 2948#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2949#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2958#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2965#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2961#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; 2962#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2976#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; 3000#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2999#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; 2998#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2990#L511-1 assume !strspn_#t~short7; 2991#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2980#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2981#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2950#L510-5 strspn_#res := strspn_~l~0; 2951#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2972#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2966#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2967#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3007#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3001#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 2996#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 2959#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; 2960#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2969#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2988#L524-4 [2018-11-18 09:18:27,713 INFO L796 eck$LassoCheckResult]: Loop: 2988#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2952#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); 2953#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2984#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2988#L524-4 [2018-11-18 09:18:27,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2018-11-18 09:18:27,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:27,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:27,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:18:27,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:18:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:27,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:27,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 09:18:27,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 09:18:27,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:27,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:27,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:27,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-18 09:18:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:18:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:18:28,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-18 09:18:28,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:28,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2018-11-18 09:18:28,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:28,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 09:18:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:18:28,060 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2018-11-18 09:18:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:28,428 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-11-18 09:18:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 09:18:28,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2018-11-18 09:18:28,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:28,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2018-11-18 09:18:28,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 09:18:28,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 09:18:28,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-11-18 09:18:28,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:28,432 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-18 09:18:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-11-18 09:18:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2018-11-18 09:18:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 09:18:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-11-18 09:18:28,436 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-18 09:18:28,436 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-18 09:18:28,436 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 09:18:28,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2018-11-18 09:18:28,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:28,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:28,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:28,437 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-11-18 09:18:28,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:28,437 INFO L794 eck$LassoCheckResult]: Stem: 3320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 3286#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; 3278#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 3279#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3288#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3295#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 3291#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; 3292#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3304#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; 3327#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 3326#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; 3325#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3317#L511-1 assume !strspn_#t~short7; 3318#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 3308#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 3309#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 3280#L510-5 strspn_#res := strspn_~l~0; 3281#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 3302#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 3296#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3297#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3321#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3284#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); 3285#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3313#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3316#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3328#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3322#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 3289#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; 3290#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3299#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3314#L524-4 [2018-11-18 09:18:28,437 INFO L796 eck$LassoCheckResult]: Loop: 3314#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3282#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); 3283#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3312#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3314#L524-4 [2018-11-18 09:18:28,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2018-11-18 09:18:28,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2018-11-18 09:18:28,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2018-11-18 09:18:28,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:29,445 WARN L180 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 243 [2018-11-18 09:18:29,631 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 09:18:29,633 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:29,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:29,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:29,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:29,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:29,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:29,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:29,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:29,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-11-18 09:18:29,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:29,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:29,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,183 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2018-11-18 09:18:30,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-11-18 09:18:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,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-11-18 09:18:30,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,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-11-18 09:18:30,524 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-18 09:18:30,888 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-18 09:18:31,015 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-18 09:18:31,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:31,058 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:31,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-11-18 09:18:31,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,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-11-18 09:18:31,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:31,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:31,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,076 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:31,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:31,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,088 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:31,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,090 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:31,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,096 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-18 09:18:31,096 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 09:18:31,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,107 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-18 09:18:31,107 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 09:18:31,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:31,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:31,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:31,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:31,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:31,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:31,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:31,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:31,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:31,289 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-18 09:18:31,289 INFO L444 ModelExtractionUtils]: 75 out of 85 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 09:18:31,289 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:31,290 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:31,290 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:31,290 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-11-18 09:18:31,473 INFO L297 tatePredicateManager]: 43 out of 44 supporting invariants were superfluous and have been removed [2018-11-18 09:18:31,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:31,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:31,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:31,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:31,624 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-11-18 09:18:31,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-18 09:18:31,726 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-11-18 09:18:31,727 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-11-18 09:18:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 09:18:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-18 09:18:31,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-18 09:18:31,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:31,728 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:31,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:31,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:31,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:31,933 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-11-18 09:18:31,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-18 09:18:32,063 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-11-18 09:18:32,064 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-11-18 09:18:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 09:18:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-18 09:18:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-18 09:18:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:32,065 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:32,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:32,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:32,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:32,245 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-11-18 09:18:32,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-18 09:18:32,407 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-11-18 09:18:32,411 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-11-18 09:18:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 09:18:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-18 09:18:32,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-18 09:18:32,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:32,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-18 09:18:32,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-18 09:18:32,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:32,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2018-11-18 09:18:32,414 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 09:18:32,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2018-11-18 09:18:32,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 09:18:32,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-18 09:18:32,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2018-11-18 09:18:32,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:32,415 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-11-18 09:18:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2018-11-18 09:18:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-11-18 09:18:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 09:18:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-11-18 09:18:32,417 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-18 09:18:32,418 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-18 09:18:32,418 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 09:18:32,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2018-11-18 09:18:32,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:32,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:32,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:32,419 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-11-18 09:18:32,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:32,419 INFO L794 eck$LassoCheckResult]: Stem: 4292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4258#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; 4250#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4251#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4260#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4267#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4274#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; 4315#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4314#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; 4312#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4310#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4309#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; 4306#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 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4265#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; 4266#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4277#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; 4302#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4281#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4282#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; 4270#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; 4271#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4303#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 4252#L510-5 strspn_#res := strspn_~l~0; 4253#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4272#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4268#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4269#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4287#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4293#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); 4338#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4337#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4336#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4334#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4294#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4295#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; 4300#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4285#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4286#L524-4 [2018-11-18 09:18:32,419 INFO L796 eck$LassoCheckResult]: Loop: 4286#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4254#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); 4255#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4283#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4286#L524-4 [2018-11-18 09:18:32,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2018-11-18 09:18:32,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:32,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:32,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:18:32,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:18:32,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9899deb1-9c5e-463d-a82b-712973837f6d/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-11-18 09:18:32,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:32,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:32,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-18 09:18:32,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 09:18:32,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:32,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:32,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 09:18:32,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-11-18 09:18:32,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 09:18:32,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 09:18:32,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:18:32,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:32,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:18:32,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 09:18:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:18:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:18:32,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-11-18 09:18:32,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:32,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2018-11-18 09:18:32,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:32,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:32,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:32,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:32,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 09:18:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-11-18 09:18:33,015 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 25 states. [2018-11-18 09:18:33,723 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 09:18:34,001 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 09:18:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:34,110 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-11-18 09:18:34,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 09:18:34,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2018-11-18 09:18:34,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:34,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2018-11-18 09:18:34,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-18 09:18:34,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-18 09:18:34,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2018-11-18 09:18:34,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:18:34,112 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-11-18 09:18:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2018-11-18 09:18:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-11-18 09:18:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 09:18:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-11-18 09:18:34,114 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-18 09:18:34,114 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-18 09:18:34,114 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 09:18:34,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2018-11-18 09:18:34,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:18:34,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:34,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:34,115 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-11-18 09:18:34,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:18:34,116 INFO L794 eck$LassoCheckResult]: Stem: 4691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4654#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4653#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; 4645#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~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);call write~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);assume { :begin_inline_strtok_r } true;strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4646#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4655#L532-2 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4662#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4670#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; 4741#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4740#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; 4739#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4738#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4736#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; 4735#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; 4671#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4658#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; 4659#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4672#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; 4723#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4722#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; 4721#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4688#L511-1 assume !strspn_#t~short7; 4689#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4675#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4676#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 4647#L510-5 strspn_#res := strspn_~l~0; 4648#L517 strtok_r_#t~ret19 := strspn_#res;assume { :end_inline_strspn } true;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4682#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;assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4663#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4664#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4685#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4651#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); 4652#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4686#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4687#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4698#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4692#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4693#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; 4695#L523-4 assume true;call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4683#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4684#L524-4 [2018-11-18 09:18:34,116 INFO L796 eck$LassoCheckResult]: Loop: 4684#L524-4 assume true;call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4649#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); 4650#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4679#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4684#L524-4 [2018-11-18 09:18:34,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2018-11-18 09:18:34,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:34,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2018-11-18 09:18:34,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:34,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2018-11-18 09:18:34,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:35,572 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 378 DAG size of output: 274 [2018-11-18 09:18:35,782 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-11-18 09:18:35,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:35,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:35,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:35,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:35,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:35,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:35,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:35,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:35,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2018-11-18 09:18:35,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:35,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:35,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:35,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-11-18 09:18:36,524 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 162 [2018-11-18 09:18:36,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:36,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:37,383 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-18 09:18:37,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:37,506 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:37,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:37,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:37,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:37,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:37,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:37,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:37,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:37,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,548 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:18:37,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,549 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:18:37,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:37,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:37,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:37,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:37,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:37,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:37,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:37,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:37,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:37,607 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 09:18:37,608 INFO L444 ModelExtractionUtils]: 65 out of 76 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 09:18:37,608 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:37,608 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:18:37,608 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:37,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2018-11-18 09:18:38,012 INFO L297 tatePredicateManager]: 69 out of 69 supporting invariants were superfluous and have been removed [2018-11-18 09:18:38,013 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:18:38,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:38,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:18:38,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-18 09:18:38,073 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-11-18 09:18:38,075 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-11-18 09:18:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:18:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-18 09:18:38,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-18 09:18:38,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:38,075 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:38,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:38,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:18:38,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-18 09:18:38,134 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-11-18 09:18:38,136 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-11-18 09:18:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:18:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-18 09:18:38,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-18 09:18:38,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:38,136 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:18:38,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:38,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:38,197 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:18:38,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-18 09:18:38,210 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-11-18 09:18:38,215 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-11-18 09:18:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:18:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-18 09:18:38,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-18 09:18:38,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:38,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-18 09:18:38,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:38,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2018-11-18 09:18:38,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:38,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2018-11-18 09:18:38,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:18:38,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:18:38,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:18:38,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:38,218 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 09:18:38,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:18:38,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:18:38,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:18:38,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:18:38 BoogieIcfgContainer [2018-11-18 09:18:38,225 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:18:38,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:18:38,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:18:38,225 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:18:38,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:11" (3/4) ... [2018-11-18 09:18:38,229 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:18:38,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:18:38,230 INFO L168 Benchmark]: Toolchain (without parser) took 27441.79 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 886.0 MB). Free memory was 956.4 MB in the beginning and 1.5 GB in the end (delta: -519.9 MB). Peak memory consumption was 366.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,230 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:18:38,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 41.9 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,232 INFO L168 Benchmark]: Boogie Preprocessor took 64.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.8 MB). Peak memory consumption was 73.7 kB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,232 INFO L168 Benchmark]: RCFGBuilder took 407.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,232 INFO L168 Benchmark]: BuchiAutomizer took 26594.72 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 695.2 MB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -323.2 MB). Peak memory consumption was 372.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:38,233 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:18:38,236 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 41.9 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.8 MB). Peak memory consumption was 73.7 kB. Max. memory is 11.5 GB. * RCFGBuilder took 407.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26594.72 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 695.2 MB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -323.2 MB). Peak memory consumption was 372.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 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 -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] 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[__builtin_alloca (in_len)] + -1 * s and consists of 5 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 + -1 * reject + unknown-#length-unknown[reject] and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.5s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 20.0s. Construction of modules took 1.0s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 283 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: 601 SDtfs, 1628 SDslu, 1397 SDs, 0 SdLazy, 1684 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI1 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital340 mio100 ax100 hnf99 lsp95 ukn84 mio100 lsp38 div103 bol100 ite100 ukn100 eq192 hnf86 smp96 dnf152 smp87 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms 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...