./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strtok_r_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strtok_r_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-2e94e6a [2019-01-01 21:42:11,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:42:11,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:42:11,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:42:11,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:42:11,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:42:11,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:42:11,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:42:11,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:42:11,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:42:11,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:42:11,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:42:11,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:42:11,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:42:11,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:42:11,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:42:11,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:42:11,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:42:11,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:42:11,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:42:11,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:42:11,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:42:11,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:42:11,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:42:11,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:42:11,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:42:11,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:42:11,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:42:11,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:42:11,124 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:42:11,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:42:11,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:42:11,126 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:42:11,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:42:11,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:42:11,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:42:11,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:42:11,153 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:42:11,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:42:11,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:42:11,155 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:42:11,155 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:42:11,155 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:42:11,155 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:42:11,157 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:42:11,158 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:42:11,158 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:42:11,158 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:42:11,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:42:11,158 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:42:11,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:42:11,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:42:11,160 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:42:11,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:42:11,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:42:11,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:42:11,161 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:42:11,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:42:11,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:42:11,162 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:42:11,166 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:42:11,166 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-01 21:42:11,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:42:11,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:42:11,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:42:11,226 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:42:11,226 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:42:11,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strtok_r_true-termination.c.i [2019-01-01 21:42:11,285 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eba5cf4/246d41d2205943f6854011ca242da03a/FLAG10d700695 [2019-01-01 21:42:11,819 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:42:11,822 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strtok_r_true-termination.c.i [2019-01-01 21:42:11,841 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eba5cf4/246d41d2205943f6854011ca242da03a/FLAG10d700695 [2019-01-01 21:42:12,081 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eba5cf4/246d41d2205943f6854011ca242da03a [2019-01-01 21:42:12,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:42:12,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:42:12,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:12,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:42:12,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:42:12,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356421ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12, skipping insertion in model container [2019-01-01 21:42:12,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:42:12,156 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:42:12,574 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:12,598 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:42:12,685 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:12,840 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:42:12,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12 WrapperNode [2019-01-01 21:42:12,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:12,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:12,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:42:12,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:42:12,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:12,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:42:12,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:42:12,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:42:12,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... [2019-01-01 21:42:12,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:42:12,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:42:12,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:42:12,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:42:12,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:42:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:42:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:42:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:42:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:42:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:42:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:42:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 21:42:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:42:13,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:42:13,684 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:42:13,684 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-01 21:42:13,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:13 BoogieIcfgContainer [2019-01-01 21:42:13,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:42:13,686 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:42:13,686 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:42:13,690 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:42:13,691 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:13,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:42:12" (1/3) ... [2019-01-01 21:42:13,692 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3281268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:13, skipping insertion in model container [2019-01-01 21:42:13,692 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:13,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:12" (2/3) ... [2019-01-01 21:42:13,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3281268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:13, skipping insertion in model container [2019-01-01 21:42:13,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:13,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:13" (3/3) ... [2019-01-01 21:42:13,695 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2019-01-01 21:42:13,754 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:42:13,755 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:42:13,755 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:42:13,755 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:42:13,756 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:42:13,756 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:42:13,756 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:42:13,756 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:42:13,756 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:42:13,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2019-01-01 21:42:13,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:13,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:13,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:13,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:13,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:13,803 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:42:13,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2019-01-01 21:42:13,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:13,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:13,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:13,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:13,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:13,817 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 7#L544true assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 9#L532true assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 12#L532-2true strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 20#L510-4true [2019-01-01 21:42:13,818 INFO L796 eck$LassoCheckResult]: Loop: 20#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 11#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 21#L511-6true assume !true; 22#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 25#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 16#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 20#L510-4true [2019-01-01 21:42:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2019-01-01 21:42:13,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:13,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:13,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:14,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:14,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:42:14,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2019-01-01 21:42:14,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:14,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:14,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:14,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:42:14,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:42:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:42:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:42:14,110 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-01-01 21:42:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:14,121 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-01 21:42:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:42:14,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2019-01-01 21:42:14,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:14,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2019-01-01 21:42:14,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 21:42:14,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 21:42:14,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-01-01 21:42:14,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:14,136 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-01 21:42:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-01-01 21:42:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 21:42:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:42:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-01-01 21:42:14,174 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-01 21:42:14,174 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-01 21:42:14,174 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:42:14,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-01-01 21:42:14,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:14,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:14,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:14,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:14,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:14,177 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 85#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 79#L532 assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 87#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 92#L510-4 [2019-01-01 21:42:14,177 INFO L796 eck$LassoCheckResult]: Loop: 92#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 90#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 91#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 96#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 101#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 97#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 98#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 94#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 92#L510-4 [2019-01-01 21:42:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2019-01-01 21:42:14,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:42:14,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2019-01-01 21:42:14,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,847 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-01 21:42:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:42:14,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:42:14,914 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:42:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:15,015 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-01 21:42:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:42:15,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-01-01 21:42:15,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:15,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2019-01-01 21:42:15,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 21:42:15,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 21:42:15,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2019-01-01 21:42:15,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:15,022 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-01 21:42:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2019-01-01 21:42:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 21:42:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:42:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-01 21:42:15,026 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-01 21:42:15,026 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-01 21:42:15,026 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:42:15,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2019-01-01 21:42:15,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:42:15,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:15,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:15,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:15,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:15,030 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 146#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 140#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 148#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 153#L510-4 [2019-01-01 21:42:15,031 INFO L796 eck$LassoCheckResult]: Loop: 153#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 151#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 152#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 157#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 158#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 159#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 155#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 153#L510-4 [2019-01-01 21:42:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2019-01-01 21:42:15,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:15,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2019-01-01 21:42:15,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:15,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2019-01-01 21:42:15,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:15,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:15,840 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-01 21:42:16,766 WARN L181 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 146 [2019-01-01 21:42:17,156 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-01 21:42:17,171 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:17,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:17,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:17,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:17,172 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:17,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:17,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:17,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:17,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:42:17,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:17,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:17,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:17,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:17,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,073 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-01-01 21:42:18,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:18,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:20,563 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-01-01 21:42:20,670 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:20,676 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:20,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:20,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:20,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:20,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:20,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:20,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:20,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,693 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:42:20,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:42:20,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:20,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,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 [2019-01-01 21:42:20,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,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 [2019-01-01 21:42:20,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:20,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:20,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:20,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:20,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,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 [2019-01-01 21:42:20,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:20,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 [2019-01-01 21:42:20,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:20,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:20,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:20,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:20,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:20,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:20,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:20,967 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:42:20,967 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:42:20,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:20,973 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:20,977 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:20,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~s.offset, v_rep(select #length ULTIMATE.start_strspn_~s.base)_1) = -1*ULTIMATE.start_strspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_strspn_~s.base)_1 Supporting invariants [] [2019-01-01 21:42:21,131 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-01-01 21:42:21,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:21,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:21,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:21,270 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 [2019-01-01 21:42:21,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:42:21,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 46 states and 57 transitions. Complement of second has 4 states. [2019-01-01 21:42:21,357 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 [2019-01-01 21:42:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:42:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2019-01-01 21:42:21,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:42:21,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:21,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-01 21:42:21,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:21,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2019-01-01 21:42:21,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:21,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2019-01-01 21:42:21,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:42:21,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2019-01-01 21:42:21,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:42:21,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:42:21,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-01-01 21:42:21,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:21,366 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-01 21:42:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-01-01 21:42:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 21:42:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 21:42:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-01 21:42:21,369 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-01 21:42:21,369 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-01 21:42:21,369 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:42:21,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-01-01 21:42:21,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:42:21,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:21,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:21,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:21,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:21,371 INFO L794 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 328#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 321#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 322#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 330#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 337#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 333#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; 334#L511-6 [2019-01-01 21:42:21,372 INFO L796 eck$LassoCheckResult]: Loop: 334#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 342#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; 350#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 353#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; 334#L511-6 [2019-01-01 21:42:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2019-01-01 21:42:21,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2019-01-01 21:42:21,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2019-01-01 21:42:21,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:21,581 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:22,385 WARN L181 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 159 [2019-01-01 21:42:22,639 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-01-01 21:42:22,642 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:22,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:22,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:22,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:22,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:22,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:22,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:22,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:22,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:42:22,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:22,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:22,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:22,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,687 WARN L181 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2019-01-01 21:42:23,822 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-01 21:42:23,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:23,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:24,141 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 21:42:24,363 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-01 21:42:26,085 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-01-01 21:42:26,207 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 21:42:26,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:26,342 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:26,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:26,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:26,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:26,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,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 [2019-01-01 21:42:26,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,538 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:42:26,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,550 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:42:26,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:26,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:26,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:26,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:26,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:26,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:26,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:26,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:26,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:26,671 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:42:26,672 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:42:26,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:26,674 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:26,675 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:26,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-01-01 21:42:27,012 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2019-01-01 21:42:27,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:27,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:27,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:27,210 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 [2019-01-01 21:42:27,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 21:42:27,314 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. [2019-01-01 21:42:27,315 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 [2019-01-01 21:42:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2019-01-01 21:42:27,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:42:27,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:27,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 21:42:27,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:27,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-01 21:42:27,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:27,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2019-01-01 21:42:27,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2019-01-01 21:42:27,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2019-01-01 21:42:27,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-01 21:42:27,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-01-01 21:42:27,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2019-01-01 21:42:27,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:27,322 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-01-01 21:42:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2019-01-01 21:42:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2019-01-01 21:42:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 21:42:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2019-01-01 21:42:27,327 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-01-01 21:42:27,327 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-01-01 21:42:27,327 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:42:27,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2019-01-01 21:42:27,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:42:27,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:27,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:27,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:27,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:27,330 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 620#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 619#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 612#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 613#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 621#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 628#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 624#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 614#L510-5 strspn_#res := strspn_~l~0; 615#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 632#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 623#L523-4 [2019-01-01 21:42:27,330 INFO L796 eck$LassoCheckResult]: Loop: 623#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 629#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 643#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 616#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 617#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 622#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; 623#L523-4 [2019-01-01 21:42:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2019-01-01 21:42:27,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:27,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:27,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:27,975 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-01 21:42:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:28,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 21:42:28,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2019-01-01 21:42:28,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,478 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:42:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:42:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:42:28,509 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2019-01-01 21:42:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:28,749 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-01-01 21:42:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:42:28,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2019-01-01 21:42:28,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:42:28,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2019-01-01 21:42:28,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 21:42:28,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 21:42:28,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2019-01-01 21:42:28,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:28,756 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2019-01-01 21:42:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2019-01-01 21:42:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-01-01 21:42:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 21:42:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2019-01-01 21:42:28,763 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-01-01 21:42:28,763 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-01-01 21:42:28,763 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:42:28,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2019-01-01 21:42:28,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:42:28,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:28,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:28,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:28,766 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:28,766 INFO L794 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 751#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 750#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 743#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 744#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 752#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 759#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 764#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; 782#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 781#L511-1 assume !strspn_#t~short7; 778#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 768#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 769#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 745#L510-5 strspn_#res := strspn_~l~0; 746#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 763#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 754#L523-4 [2019-01-01 21:42:28,766 INFO L796 eck$LassoCheckResult]: Loop: 754#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 760#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 773#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 747#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 748#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 753#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; 754#L523-4 [2019-01-01 21:42:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2019-01-01 21:42:28,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2019-01-01 21:42:28,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:28,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2019-01-01 21:42:28,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:28,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:29,183 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:42:29,480 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 21:42:30,733 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 236 DAG size of output: 200 [2019-01-01 21:42:31,142 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-01-01 21:42:31,145 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:31,145 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:31,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:31,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:31,145 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:31,146 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:31,146 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:31,146 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:31,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:42:31,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:31,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:32,309 WARN L181 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 138 [2019-01-01 21:42:32,451 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-01 21:42:32,735 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 21:42:32,926 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 21:42:35,493 WARN L181 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-01-01 21:42:35,686 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 21:42:35,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:35,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:35,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,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 [2019-01-01 21:42:35,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:35,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:35,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:35,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:35,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:35,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:35,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:35,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:35,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:35,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:35,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:35,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,002 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:42:36,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,023 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:42:36,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,141 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:42:36,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:42:36,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,146 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:42:36,146 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:42:36,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:36,279 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:42:36,279 INFO L444 ModelExtractionUtils]: 67 out of 76 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 21:42:36,280 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:36,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:36,281 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:36,281 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 [] [2019-01-01 21:42:36,691 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2019-01-01 21:42:36,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:36,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:36,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:36,851 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 [2019-01-01 21:42:36,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-01-01 21:42:36,911 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. [2019-01-01 21:42:36,914 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 [2019-01-01 21:42:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-01 21:42:36,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-01 21:42:36,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:36,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-01 21:42:36,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:36,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2019-01-01 21:42:36,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:36,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 74 transitions. [2019-01-01 21:42:36,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:42:36,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 72 transitions. [2019-01-01 21:42:36,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 21:42:36,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:42:36,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2019-01-01 21:42:36,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:36,919 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2019-01-01 21:42:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2019-01-01 21:42:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-01 21:42:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 21:42:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2019-01-01 21:42:36,929 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2019-01-01 21:42:36,929 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2019-01-01 21:42:36,930 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:42:36,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2019-01-01 21:42:36,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:42:36,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:36,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:36,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:36,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:36,931 INFO L794 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1073#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1072#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 1063#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1064#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1074#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1081#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1088#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; 1116#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1102#L511-1 assume !strspn_#t~short7; 1103#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 1095#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1096#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; 1085#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; 1086#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1089#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; 1108#L511-6 [2019-01-01 21:42:36,932 INFO L796 eck$LassoCheckResult]: Loop: 1108#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1111#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; 1110#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 1107#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; 1108#L511-6 [2019-01-01 21:42:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2019-01-01 21:42:36,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:36,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:37,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:37,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:42:37,217 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2019-01-01 21:42:37,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:37,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:37,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:37,868 WARN L181 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:42:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:42:37,895 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-01-01 21:42:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:37,951 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2019-01-01 21:42:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:42:37,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 107 transitions. [2019-01-01 21:42:37,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 21:42:37,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 103 transitions. [2019-01-01 21:42:37,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 21:42:37,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 21:42:37,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 103 transitions. [2019-01-01 21:42:37,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:37,962 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2019-01-01 21:42:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 103 transitions. [2019-01-01 21:42:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-01 21:42:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 21:42:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2019-01-01 21:42:37,967 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-01-01 21:42:37,967 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-01-01 21:42:37,967 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:42:37,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2019-01-01 21:42:37,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:42:37,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:37,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:37,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:37,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:37,969 INFO L794 eck$LassoCheckResult]: Stem: 1256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1224#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1223#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 1214#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1215#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1225#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1232#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1230#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; 1231#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1268#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; 1261#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 1246#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1247#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; 1236#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; 1237#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1228#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; 1229#L511-6 [2019-01-01 21:42:37,970 INFO L796 eck$LassoCheckResult]: Loop: 1229#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1241#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; 1267#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 1259#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; 1229#L511-6 [2019-01-01 21:42:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2019-01-01 21:42:37,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:37,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:37,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2019-01-01 21:42:38,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:38,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2019-01-01 21:42:38,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:38,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:38,734 WARN L181 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:39,892 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 228 DAG size of output: 190 [2019-01-01 21:42:40,240 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-01 21:42:40,244 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:40,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:40,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:40,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:40,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:40,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:40,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:40,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:40,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2019-01-01 21:42:40,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:40,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:40,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,074 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2019-01-01 21:42:41,227 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-01-01 21:42:41,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:41,488 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 21:42:41,837 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-01 21:42:43,506 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-01-01 21:42:43,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:43,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:43,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,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 [2019-01-01 21:42:43,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,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 [2019-01-01 21:42:43,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,832 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:42:43,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,838 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:42:43,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,882 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:43,882 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 21:42:43,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,889 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-01-01 21:42:43,889 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 21:42:43,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,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 [2019-01-01 21:42:43,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:43,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:43,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:43,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:43,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:43,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:43,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:43,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:43,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:43,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:43,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:43,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:44,016 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:42:44,016 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:42:44,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:44,017 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:44,020 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:44,020 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4 Supporting invariants [] [2019-01-01 21:42:44,242 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2019-01-01 21:42:44,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:44,341 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 [2019-01-01 21:42:44,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 21:42:44,450 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. [2019-01-01 21:42:44,453 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 [2019-01-01 21:42:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-01-01 21:42:44,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-01 21:42:44,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:44,454 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:42:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:44,558 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 [2019-01-01 21:42:44,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 21:42:44,666 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. [2019-01-01 21:42:44,669 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 [2019-01-01 21:42:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-01-01 21:42:44,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-01 21:42:44,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:44,671 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:42:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:44,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:44,822 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 [2019-01-01 21:42:44,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 21:42:44,949 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. [2019-01-01 21:42:44,951 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 [2019-01-01 21:42:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2019-01-01 21:42:44,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-01 21:42:44,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:44,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-01 21:42:44,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:44,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2019-01-01 21:42:44,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:44,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2019-01-01 21:42:44,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:44,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2019-01-01 21:42:44,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:42:44,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 21:42:44,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2019-01-01 21:42:44,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:44,961 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-01-01 21:42:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2019-01-01 21:42:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2019-01-01 21:42:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:42:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-01-01 21:42:44,969 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-01 21:42:44,969 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-01 21:42:44,969 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:42:44,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2019-01-01 21:42:44,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:44,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:44,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:44,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:44,972 INFO L794 eck$LassoCheckResult]: Stem: 2003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1973#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1972#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 1963#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1964#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1974#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1981#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1977#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; 1978#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1990#L511-1 assume !strspn_#t~short7; 2001#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 1993#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1994#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 1965#L510-5 strspn_#res := strspn_~l~0; 1966#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 1987#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1982#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1984#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1999#L524-4 [2019-01-01 21:42:44,972 INFO L796 eck$LassoCheckResult]: Loop: 1999#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1967#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); 1968#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 1997#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 1999#L524-4 [2019-01-01 21:42:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2019-01-01 21:42:44,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:44,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:44,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2019-01-01 21:42:45,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:45,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2019-01-01 21:42:45,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:45,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:45,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:45,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:45,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 21:42:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:42:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:42:45,846 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-01 21:42:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:46,264 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-01-01 21:42:46,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:42:46,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2019-01-01 21:42:46,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:42:46,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2019-01-01 21:42:46,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 21:42:46,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 21:42:46,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2019-01-01 21:42:46,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:46,268 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-01-01 21:42:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2019-01-01 21:42:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2019-01-01 21:42:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:42:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-01-01 21:42:46,271 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-01-01 21:42:46,271 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-01-01 21:42:46,271 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:42:46,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2019-01-01 21:42:46,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:46,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:46,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:46,273 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] [2019-01-01 21:42:46,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:46,273 INFO L794 eck$LassoCheckResult]: Stem: 2173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2143#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2142#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 2133#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2134#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2144#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2151#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2149#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; 2150#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2161#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; 2178#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2164#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2165#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; 2155#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; 2156#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2158#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 2135#L510-5 strspn_#res := strspn_~l~0; 2136#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2157#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2152#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2153#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2168#L524-4 [2019-01-01 21:42:46,273 INFO L796 eck$LassoCheckResult]: Loop: 2168#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2137#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); 2138#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2166#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2168#L524-4 [2019-01-01 21:42:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2019-01-01 21:42:46,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:46,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:46,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:42:46,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:42:46,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:46,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:46,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 21:42:46,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:42:46,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 21:42:46,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 21:42:46,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:42:46,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:42:46,994 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. [2019-01-01 21:42:46,995 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2019-01-01 21:42:47,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 21:42:47,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 21:42:47,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:42:47,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:42:47,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:42:47,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 21:42:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:47,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:42:47,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-01-01 21:42:47,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2019-01-01 21:42:47,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:47,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 21:42:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-01-01 21:42:47,873 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 23 states. [2019-01-01 21:42:49,450 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 21:42:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:49,762 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2019-01-01 21:42:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:42:49,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2019-01-01 21:42:49,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:49,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2019-01-01 21:42:49,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 21:42:49,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-01 21:42:49,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2019-01-01 21:42:49,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:49,767 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2019-01-01 21:42:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2019-01-01 21:42:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2019-01-01 21:42:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 21:42:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2019-01-01 21:42:49,785 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-01 21:42:49,785 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-01 21:42:49,785 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:42:49,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2019-01-01 21:42:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:49,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:49,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:49,787 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] [2019-01-01 21:42:49,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:49,787 INFO L794 eck$LassoCheckResult]: Stem: 2415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2383#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2382#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 2373#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2374#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2384#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2391#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2387#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; 2388#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2400#L511-1 assume !strspn_#t~short7; 2414#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2416#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; 2401#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2402#L511-1 assume !strspn_#t~short7; 2413#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2403#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2404#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2375#L510-5 strspn_#res := strspn_~l~0; 2376#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2397#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2392#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2393#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2411#L524-4 [2019-01-01 21:42:49,787 INFO L796 eck$LassoCheckResult]: Loop: 2411#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2377#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); 2378#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2407#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2411#L524-4 [2019-01-01 21:42:49,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2019-01-01 21:42:49,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:49,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:49,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:49,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:42:49,860 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2019-01-01 21:42:49,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,187 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:42:50,406 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:42:50,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:42:50,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:42:50,407 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-01-01 21:42:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:50,493 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2019-01-01 21:42:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:42:50,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2019-01-01 21:42:50,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:50,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2019-01-01 21:42:50,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:42:50,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:42:50,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2019-01-01 21:42:50,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:50,496 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-01-01 21:42:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2019-01-01 21:42:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-01 21:42:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 21:42:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-01-01 21:42:50,502 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-01-01 21:42:50,502 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-01-01 21:42:50,502 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:42:50,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2019-01-01 21:42:50,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:50,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:50,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:50,506 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] [2019-01-01 21:42:50,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:50,506 INFO L794 eck$LassoCheckResult]: Stem: 2539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2507#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2506#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 2497#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2498#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2508#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2515#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2511#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; 2512#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2524#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; 2545#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2544#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; 2543#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2536#L511-1 assume !strspn_#t~short7; 2537#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2527#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2528#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2499#L510-5 strspn_#res := strspn_~l~0; 2500#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2521#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2516#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2517#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2534#L524-4 [2019-01-01 21:42:50,507 INFO L796 eck$LassoCheckResult]: Loop: 2534#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2501#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); 2502#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2531#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2534#L524-4 [2019-01-01 21:42:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2019-01-01 21:42:50,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:50,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2019-01-01 21:42:50,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2019-01-01 21:42:50,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:50,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:50,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:50,899 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:42:51,053 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:42:52,554 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 282 DAG size of output: 230 [2019-01-01 21:42:52,995 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2019-01-01 21:42:53,001 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:53,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:53,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:53,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:53,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:53,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:53,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:53,002 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:53,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2019-01-01 21:42:53,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:53,002 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:53,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,311 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 158 [2019-01-01 21:42:54,491 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-01 21:42:54,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:54,803 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 21:42:55,145 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-01-01 21:42:57,829 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-01-01 21:42:58,006 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 21:42:58,360 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-01 21:42:58,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:58,450 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:58,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,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 [2019-01-01 21:42:58,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,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 [2019-01-01 21:42:58,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,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 [2019-01-01 21:42:58,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,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 [2019-01-01 21:42:58,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,518 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:42:58,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,525 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:42:58,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:58,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:42:58,623 INFO L444 ModelExtractionUtils]: 77 out of 82 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:42:58,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:58,627 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:58,628 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:58,628 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 [] [2019-01-01 21:42:59,300 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2019-01-01 21:42:59,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:59,441 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 [2019-01-01 21:42:59,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 21:42:59,461 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. [2019-01-01 21:42:59,462 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 [2019-01-01 21:42:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:42:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-01 21:42:59,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2019-01-01 21:42:59,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:59,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2019-01-01 21:42:59,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:59,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2019-01-01 21:42:59,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:59,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2019-01-01 21:42:59,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:59,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2019-01-01 21:42:59,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:42:59,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:42:59,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2019-01-01 21:42:59,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:59,468 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-01-01 21:42:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2019-01-01 21:42:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-01-01 21:42:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 21:42:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-01-01 21:42:59,479 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-01-01 21:42:59,479 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-01-01 21:42:59,479 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:42:59,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2019-01-01 21:42:59,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:59,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:59,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:59,484 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] [2019-01-01 21:42:59,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:59,484 INFO L794 eck$LassoCheckResult]: Stem: 3007#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2970#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2969#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 2961#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2962#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2971#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2978#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2974#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; 2975#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2989#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; 3013#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 3012#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; 3011#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3003#L511-1 assume !strspn_#t~short7; 3004#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 2993#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2994#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2963#L510-5 strspn_#res := strspn_~l~0; 2964#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2985#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2979#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2980#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3020#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3014#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3009#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 2972#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; 2973#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2981#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3001#L524-4 [2019-01-01 21:42:59,484 INFO L796 eck$LassoCheckResult]: Loop: 3001#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2965#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); 2966#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 2997#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3001#L524-4 [2019-01-01 21:42:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2019-01-01 21:42:59,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:59,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:59,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:42:59,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:42:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:00,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-01 21:43:00,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-01-01 21:43:00,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:00,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:00,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:00,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-01-01 21:43:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:43:00,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:43:00,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-01-01 21:43:00,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2019-01-01 21:43:00,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:00,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 21:43:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:43:00,165 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2019-01-01 21:43:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:00,770 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2019-01-01 21:43:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 21:43:00,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2019-01-01 21:43:00,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:43:00,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2019-01-01 21:43:00,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-01 21:43:00,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 21:43:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2019-01-01 21:43:00,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:00,780 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2019-01-01 21:43:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2019-01-01 21:43:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2019-01-01 21:43:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 21:43:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-01-01 21:43:00,784 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-01-01 21:43:00,784 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-01-01 21:43:00,784 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 21:43:00,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2019-01-01 21:43:00,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:00,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:00,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:00,786 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] [2019-01-01 21:43:00,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:00,786 INFO L794 eck$LassoCheckResult]: Stem: 3333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3300#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 3299#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 3291#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 3292#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3301#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3308#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 3304#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; 3305#L511-6 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;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; 3339#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 3338#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; 3337#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3330#L511-1 assume !strspn_#t~short7; 3331#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 3321#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 3322#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 3293#L510-5 strspn_#res := strspn_~l~0; 3294#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 3315#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 3309#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3310#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3328#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3297#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); 3298#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 3326#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3329#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3340#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3334#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 3302#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; 3303#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3311#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3327#L524-4 [2019-01-01 21:43:00,786 INFO L796 eck$LassoCheckResult]: Loop: 3327#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3295#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); 3296#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 3325#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3327#L524-4 [2019-01-01 21:43:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2019-01-01 21:43:00,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:00,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2019-01-01 21:43:00,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2019-01-01 21:43:00,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:01,177 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:43:01,313 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:43:03,131 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 333 DAG size of output: 259 [2019-01-01 21:43:03,561 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-01-01 21:43:03,564 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:03,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:03,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:03,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:03,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:03,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:03,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:03,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:03,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2019-01-01 21:43:03,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:03,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:03,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,091 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2019-01-01 21:43:05,250 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:43:05,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:05,675 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 21:43:05,931 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-01 21:43:06,506 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-01 21:43:09,046 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-01-01 21:43:09,298 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-01 21:43:09,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:09,389 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:09,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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 [2019-01-01 21:43:09,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:09,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:09,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:09,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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 [2019-01-01 21:43:09,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:09,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:09,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:09,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,414 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-01 21:43:09,415 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 21:43:09,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,428 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2019-01-01 21:43:09,428 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 21:43:09,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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 [2019-01-01 21:43:09,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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 [2019-01-01 21:43:09,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,513 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:43:09,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,522 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:43:09,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:09,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,670 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:09,762 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-01-01 21:43:09,762 INFO L444 ModelExtractionUtils]: 76 out of 88 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-01-01 21:43:09,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:09,763 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:09,763 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:09,763 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 [] [2019-01-01 21:43:10,437 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2019-01-01 21:43:10,441 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:43:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:10,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:10,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:10,755 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 [2019-01-01 21:43:10,755 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2019-01-01 21:43:10,927 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. [2019-01-01 21:43:10,933 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 [2019-01-01 21:43:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2019-01-01 21:43:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-01 21:43:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:10,934 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:11,452 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 [2019-01-01 21:43:11,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2019-01-01 21:43:11,677 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. [2019-01-01 21:43:11,679 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 [2019-01-01 21:43:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2019-01-01 21:43:11,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-01 21:43:11,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:11,680 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:12,035 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 [2019-01-01 21:43:12,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2019-01-01 21:43:12,792 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. [2019-01-01 21:43:12,794 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 [2019-01-01 21:43:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2019-01-01 21:43:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-01 21:43:12,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2019-01-01 21:43:12,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:12,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2019-01-01 21:43:12,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:12,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2019-01-01 21:43:12,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:43:12,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2019-01-01 21:43:12,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 21:43:12,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 21:43:12,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2019-01-01 21:43:12,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:12,800 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2019-01-01 21:43:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2019-01-01 21:43:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2019-01-01 21:43:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 21:43:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2019-01-01 21:43:12,810 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-01-01 21:43:12,810 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-01-01 21:43:12,810 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 21:43:12,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2019-01-01 21:43:12,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:12,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:12,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:12,814 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] [2019-01-01 21:43:12,814 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:12,814 INFO L794 eck$LassoCheckResult]: Stem: 4313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4280#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4279#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 4271#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4272#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4281#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4288#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4295#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; 4336#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4335#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; 4333#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 4331#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4330#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; 4327#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; 4296#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4286#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; 4287#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4299#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; 4323#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 4302#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4303#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; 4291#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; 4292#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4324#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 4273#L510-5 strspn_#res := strspn_~l~0; 4274#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4293#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4289#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4290#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4308#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4314#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); 4359#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4358#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4357#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4355#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4315#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4316#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; 4321#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4306#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4307#L524-4 [2019-01-01 21:43:12,815 INFO L796 eck$LassoCheckResult]: Loop: 4307#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4275#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); 4276#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4304#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4307#L524-4 [2019-01-01 21:43:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2019-01-01 21:43:12,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:12,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:13,231 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:43:13,482 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:43:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:43:13,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:43:13,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:43:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:13,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 21:43:13,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 21:43:13,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,779 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. [2019-01-01 21:43:13,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2019-01-01 21:43:14,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 21:43:14,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 21:43:14,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:14,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:14,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:14,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 21:43:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:43:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:43:14,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-01-01 21:43:14,370 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2019-01-01 21:43:14,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:14,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:14,490 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:43:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 21:43:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2019-01-01 21:43:14,512 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 27 states. [2019-01-01 21:43:15,641 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 21:43:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:15,889 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2019-01-01 21:43:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:43:15,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2019-01-01 21:43:15,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:15,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2019-01-01 21:43:15,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-01 21:43:15,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-01 21:43:15,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2019-01-01 21:43:15,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:15,895 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-01-01 21:43:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2019-01-01 21:43:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2019-01-01 21:43:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 21:43:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2019-01-01 21:43:15,900 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-01-01 21:43:15,900 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-01-01 21:43:15,900 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 21:43:15,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2019-01-01 21:43:15,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:15,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:15,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:15,911 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] [2019-01-01 21:43:15,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:15,912 INFO L794 eck$LassoCheckResult]: Stem: 4713#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4676#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4675#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.allocOnStack(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; 4667#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.allocOnStack(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.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4668#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4677#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4684#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4692#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; 4763#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4762#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; 4761#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 4760#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4758#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; 4757#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; 4693#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4680#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; 4681#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4694#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; 4745#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 4744#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; 4743#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4710#L511-1 assume !strspn_#t~short7; 4711#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~mem6;havoc strspn_#t~short7; 4697#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4698#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 4669#L510-5 strspn_#res := strspn_~l~0; 4670#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4704#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4685#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4686#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4707#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4673#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); 4674#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4708#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4709#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4720#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4714#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4715#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; 4717#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4705#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4706#L524-4 [2019-01-01 21:43:15,912 INFO L796 eck$LassoCheckResult]: Loop: 4706#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4671#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); 4672#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem14;havoc strcspn_#t~mem13; 4701#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4706#L524-4 [2019-01-01 21:43:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2019-01-01 21:43:15,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2019-01-01 21:43:15,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:15,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2019-01-01 21:43:15,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:15,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:15,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:16,316 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:43:18,687 WARN L181 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 388 DAG size of output: 287 [2019-01-01 21:43:19,166 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-01 21:43:19,169 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:19,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:19,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:19,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:19,170 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:19,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:19,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:19,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:19,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2019-01-01 21:43:19,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:19,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:19,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,578 WARN L181 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 164 [2019-01-01 21:43:20,828 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-01-01 21:43:21,133 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 21:43:21,336 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 21:43:22,143 WARN L181 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 21:43:22,407 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 21:43:24,987 WARN L181 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-01-01 21:43:25,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:25,063 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:25,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,129 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-01 21:43:25,129 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 21:43:25,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,145 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2019-01-01 21:43:25,145 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 21:43:25,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:25,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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 [2019-01-01 21:43:25,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,444 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:25,532 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:43:25,532 INFO L444 ModelExtractionUtils]: 70 out of 76 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:43:25,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:25,533 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:25,535 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:25,535 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2019-01-01 21:43:26,640 INFO L297 tatePredicateManager]: 71 out of 71 supporting invariants were superfluous and have been removed [2019-01-01 21:43:26,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:43:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:26,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:26,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:26,750 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 [2019-01-01 21:43:26,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2019-01-01 21:43:26,787 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. [2019-01-01 21:43:26,789 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 [2019-01-01 21:43:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:43:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-01 21:43:26,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2019-01-01 21:43:26,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:26,790 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:26,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:26,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:26,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:26,880 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 [2019-01-01 21:43:26,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2019-01-01 21:43:26,955 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. [2019-01-01 21:43:26,956 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 [2019-01-01 21:43:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:43:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-01 21:43:26,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2019-01-01 21:43:26,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:26,957 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:27,092 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 [2019-01-01 21:43:27,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2019-01-01 21:43:27,115 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. [2019-01-01 21:43:27,117 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 [2019-01-01 21:43:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:43:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-01 21:43:27,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2019-01-01 21:43:27,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:27,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2019-01-01 21:43:27,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:27,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2019-01-01 21:43:27,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:27,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2019-01-01 21:43:27,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:27,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2019-01-01 21:43:27,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:43:27,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:43:27,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:43:27,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:27,121 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:27,121 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:27,121 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:27,121 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 21:43:27,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:43:27,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:27,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:43:27,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:43:27 BoogieIcfgContainer [2019-01-01 21:43:27,145 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:43:27,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:43:27,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:43:27,147 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:43:27,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:13" (3/4) ... [2019-01-01 21:43:27,155 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:43:27,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:43:27,156 INFO L168 Benchmark]: Toolchain (without parser) took 75070.58 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 742.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -370.4 MB). Peak memory consumption was 372.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,157 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:27,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,159 INFO L168 Benchmark]: Boogie Preprocessor took 41.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,159 INFO L168 Benchmark]: RCFGBuilder took 730.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,160 INFO L168 Benchmark]: BuchiAutomizer took 73459.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 600.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.8 MB). Peak memory consumption was 374.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:27,161 INFO L168 Benchmark]: Witness Printer took 8.37 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:27,165 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 753.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 730.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 73459.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 600.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.8 MB). Peak memory consumption was 374.5 MB. Max. memory is 11.5 GB. * Witness Printer took 8.37 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 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[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (delim_len)] + -1 * a 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 -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 5 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 73.3s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 63.7s. Construction of modules took 2.4s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.1s 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: 604 SDtfs, 1639 SDslu, 1209 SDs, 0 SdLazy, 1480 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI1 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital380 mio100 ax100 hnf99 lsp96 ukn76 mio100 lsp39 div103 bol100 ite100 ukn100 eq195 hnf87 smp96 dnf516 smp97 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 92ms 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...