./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strtol.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/termination-dietlibc/strtol.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 7d3a15f933181b44751784c7ab9846d6b1216531 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:32:11,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:32:11,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:32:11,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:32:11,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:32:11,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:32:11,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:32:11,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:32:11,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:32:11,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:32:11,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:32:11,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:32:11,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:32:11,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:32:11,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:32:11,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:32:11,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:32:11,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:32:11,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:32:11,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:32:11,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:32:11,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:32:11,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:32:11,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:32:11,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:32:11,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:32:11,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:32:11,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:32:11,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:32:11,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:32:11,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:32:11,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:32:11,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:32:11,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:32:11,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:32:11,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:32:11,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:32:11,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:32:11,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:32:11,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:32:11,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:32:11,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:32:11,254 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:32:11,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:32:11,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:32:11,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:32:11,259 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:32:11,259 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:32:11,259 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:32:11,259 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:32:11,260 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:32:11,260 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:32:11,260 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:32:11,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:32:11,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:32:11,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:32:11,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:32:11,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:32:11,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:32:11,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:32:11,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:32:11,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:32:11,262 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:32:11,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:32:11,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:32:11,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:32:11,263 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:32:11,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:32:11,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:32:11,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:32:11,264 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:32:11,265 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:32:11,265 INFO L138 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 -> 7d3a15f933181b44751784c7ab9846d6b1216531 [2020-07-29 01:32:11,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:32:11,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:32:11,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:32:11,571 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:32:11,571 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:32:11,572 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strtol.i [2020-07-29 01:32:11,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7bb69c3/095ac3f3f4044a7fbd29d7a49a717df9/FLAG53123e0b7 [2020-07-29 01:32:12,176 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:32:12,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strtol.i [2020-07-29 01:32:12,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7bb69c3/095ac3f3f4044a7fbd29d7a49a717df9/FLAG53123e0b7 [2020-07-29 01:32:12,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7bb69c3/095ac3f3f4044a7fbd29d7a49a717df9 [2020-07-29 01:32:12,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:32:12,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:32:12,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:12,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:32:12,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:32:12,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:12" (1/1) ... [2020-07-29 01:32:12,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76497eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:12, skipping insertion in model container [2020-07-29 01:32:12,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:12" (1/1) ... [2020-07-29 01:32:12,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:32:12,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:32:13,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:13,018 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:32:13,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:13,181 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:32:13,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13 WrapperNode [2020-07-29 01:32:13,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:13,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:13,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:32:13,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:32:13,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:13,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:32:13,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:32:13,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:32:13,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (1/1) ... [2020-07-29 01:32:13,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:32:13,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:32:13,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:32:13,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:32:13,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (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 [2020-07-29 01:32:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:32:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:32:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:32:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:32:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:32:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:32:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 01:32:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:32:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:32:14,147 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:32:14,148 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-29 01:32:14,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:14 BoogieIcfgContainer [2020-07-29 01:32:14,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:32:14,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:32:14,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:32:14,159 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:32:14,160 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:14,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:32:12" (1/3) ... [2020-07-29 01:32:14,162 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a67317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:14, skipping insertion in model container [2020-07-29 01:32:14,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:14,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:13" (2/3) ... [2020-07-29 01:32:14,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a67317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:14, skipping insertion in model container [2020-07-29 01:32:14,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:14,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:14" (3/3) ... [2020-07-29 01:32:14,166 INFO L371 chiAutomizerObserver]: Analyzing ICFG strtol.i [2020-07-29 01:32:14,225 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:32:14,226 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:32:14,226 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:32:14,226 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:32:14,227 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:32:14,227 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:32:14,227 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:32:14,227 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:32:14,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-29 01:32:14,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 01:32:14,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:14,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:14,312 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:32:14,312 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:32:14,312 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:32:14,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-29 01:32:14,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 01:32:14,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:14,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:14,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:32:14,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:32:14,333 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 42#L562true assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 15#L554-3true [2020-07-29 01:32:14,333 INFO L796 eck$LassoCheckResult]: Loop: 15#L554-3true call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 12#L554-1true assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 15#L554-3true [2020-07-29 01:32:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:32:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:14,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793085204] [2020-07-29 01:32:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2020-07-29 01:32:14,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:14,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133968055] [2020-07-29 01:32:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-07-29 01:32:14,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:14,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583007703] [2020-07-29 01:32:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:14,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:14,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:15,279 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2020-07-29 01:32:15,523 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-29 01:32:15,542 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:15,543 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:15,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:15,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:15,545 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:15,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:15,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:15,546 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:15,546 INFO L133 ssoRankerPreferences]: Filename of dumped script: strtol.i_Iteration1_Lasso [2020-07-29 01:32:15,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:15,547 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:15,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:15,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,013 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-07-29 01:32:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:16,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,078 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:17,084 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:17,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:17,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:17,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:17,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:17,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:17,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:17,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:17,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:17,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:17,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:17,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:17,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:17,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:17,749 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:32:17,749 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:17,797 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:17,798 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:17,799 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtol_~nptr.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1) = -1*ULTIMATE.start_strtol_~nptr.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 Supporting invariants [] [2020-07-29 01:32:17,913 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 01:32:17,924 INFO L393 LassoCheck]: Loop: "call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1);" "assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset;" [2020-07-29 01:32:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:17,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:18,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:18,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {54#unseeded} is VALID [2020-07-29 01:32:18,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#unseeded} havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; {54#unseeded} is VALID [2020-07-29 01:32:18,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#unseeded} assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; {108#(and (= |ULTIMATE.start_main_#t~malloc30.base| ULTIMATE.start_strtol_~nptr.base) unseeded)} is VALID [2020-07-29 01:32:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:18,048 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:18,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:18,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_strtol_~nptr.offset) (select |#length| |ULTIMATE.start_main_#t~malloc30.base|))) (= |ULTIMATE.start_main_#t~malloc30.base| ULTIMATE.start_strtol_~nptr.base))} call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); {123#(and (= |ULTIMATE.start_main_#t~malloc30.base| ULTIMATE.start_strtol_~nptr.base) (<= (+ ULTIMATE.start_strtol_~nptr.offset 1) (select |#length| ULTIMATE.start_strtol_~nptr.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc30.base|) (+ oldRank0 ULTIMATE.start_strtol_~nptr.offset)))} is VALID [2020-07-29 01:32:18,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#(and (= |ULTIMATE.start_main_#t~malloc30.base| ULTIMATE.start_strtol_~nptr.base) (<= (+ ULTIMATE.start_strtol_~nptr.offset 1) (select |#length| ULTIMATE.start_strtol_~nptr.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc30.base|) (+ oldRank0 ULTIMATE.start_strtol_~nptr.offset)))} assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; {111#(and (= |ULTIMATE.start_main_#t~malloc30.base| ULTIMATE.start_strtol_~nptr.base) (or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_strtol_~nptr.offset) (select |#length| |ULTIMATE.start_main_#t~malloc30.base|))) (>= oldRank0 0))))} is VALID [2020-07-29 01:32:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:18,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:32:18,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:18,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:18,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:18,131 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 [2020-07-29 01:32:18,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2020-07-29 01:32:19,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 3 states. Result 192 states and 307 transitions. Complement of second has 8 states. [2020-07-29 01:32:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:19,107 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:19,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-07-29 01:32:19,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 01:32:19,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:19,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:19,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:32:19,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:19,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:19,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:19,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 307 transitions. [2020-07-29 01:32:19,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2020-07-29 01:32:19,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:19,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:19,152 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states. [2020-07-29 01:32:19,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 01:32:19,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:32:19,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:32:19,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:19,176 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:32:19,177 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 192 states and 307 transitions. cyclomatic complexity: 126 [2020-07-29 01:32:19,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 22 examples of accepted words. [2020-07-29 01:32:19,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 192 letters. Loop has 192 letters. [2020-07-29 01:32:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 192 letters. Loop has 192 letters. [2020-07-29 01:32:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 192 letters. Loop has 192 letters. [2020-07-29 01:32:19,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:32:19,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:32:19,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:32:19,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:19,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:19,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:19,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 19 letters. Loop has 7 letters. [2020-07-29 01:32:19,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 7 letters. [2020-07-29 01:32:19,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 19 letters. Loop has 7 letters. [2020-07-29 01:32:19,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:32:19,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:32:19,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:32:19,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 18 letters. Loop has 7 letters. [2020-07-29 01:32:19,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 7 letters. [2020-07-29 01:32:19,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 7 letters. [2020-07-29 01:32:19,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:32:19,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:32:19,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:32:19,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:32:19,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:32:19,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:32:19,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 20 letters. Loop has 9 letters. [2020-07-29 01:32:19,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 9 letters. [2020-07-29 01:32:19,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 20 letters. Loop has 9 letters. [2020-07-29 01:32:19,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:32:19,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:32:19,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:32:19,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:19,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:19,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:19,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:19,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:19,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:19,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:32:19,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:19,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:19,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:19,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:19,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:19,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:19,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:19,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:19,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 192 states and 307 transitions. cyclomatic complexity: 126 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:19,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,289 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:32:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2020-07-29 01:32:19,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:32:19,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:32:19,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:32:19,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. cyclomatic complexity: 126 [2020-07-29 01:32:19,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2020-07-29 01:32:19,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2020-07-29 01:32:19,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-07-29 01:32:19,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-07-29 01:32:19,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2020-07-29 01:32:19,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:19,334 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2020-07-29 01:32:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2020-07-29 01:32:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2020-07-29 01:32:19,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:19,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 87 transitions. Second operand 35 states. [2020-07-29 01:32:19,363 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 87 transitions. Second operand 35 states. [2020-07-29 01:32:19,365 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 35 states. [2020-07-29 01:32:19,368 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:19,373 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2020-07-29 01:32:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2020-07-29 01:32:19,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:19,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:19,375 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 60 states and 87 transitions. [2020-07-29 01:32:19,375 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 60 states and 87 transitions. [2020-07-29 01:32:19,376 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:19,381 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2020-07-29 01:32:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2020-07-29 01:32:19,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:19,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:19,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:19,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 01:32:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-07-29 01:32:19,385 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-29 01:32:19,386 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-29 01:32:19,386 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:32:19,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 01:32:19,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 01:32:19,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:19,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:19,387 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:19,387 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:32:19,387 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 342#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 343#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 353#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 344#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 345#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 336#L555 assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; 337#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 351#L512-3 [2020-07-29 01:32:19,388 INFO L796 eck$LassoCheckResult]: Loop: 351#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 352#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 351#L512-3 [2020-07-29 01:32:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2020-07-29 01:32:19,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:19,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302127119] [2020-07-29 01:32:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:19,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:19,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:19,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2020-07-29 01:32:19,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:19,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742239207] [2020-07-29 01:32:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:19,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:19,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:19,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2020-07-29 01:32:19,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:19,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251042075] [2020-07-29 01:32:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {594#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {594#true} is VALID [2020-07-29 01:32:19,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {594#true} havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; {594#true} is VALID [2020-07-29 01:32:19,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {594#true} assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; {594#true} is VALID [2020-07-29 01:32:19,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {594#true} call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); {596#(= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) |ULTIMATE.start_strtol_#t~mem21|)} is VALID [2020-07-29 01:32:19,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {596#(= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) |ULTIMATE.start_strtol_#t~mem21|)} assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} is VALID [2020-07-29 01:32:19,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} is VALID [2020-07-29 01:32:19,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} is VALID [2020-07-29 01:32:19,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {597#(not (= (select (select |#memory_int| ULTIMATE.start_strtol_~nptr.base) ULTIMATE.start_strtol_~nptr.offset) 32))} strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; {598#(not (= (select (select |#memory_int| ULTIMATE.start_strtoul_~nptr~0.base) ULTIMATE.start_strtoul_~nptr~0.offset) 32))} is VALID [2020-07-29 01:32:19,637 INFO L280 TraceCheckUtils]: 8: Hoare triple {598#(not (= (select (select |#memory_int| ULTIMATE.start_strtoul_~nptr~0.base) ULTIMATE.start_strtoul_~nptr~0.offset) 32))} call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); {599#(not (= 32 |ULTIMATE.start_strtoul_#t~mem2|))} is VALID [2020-07-29 01:32:19,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {599#(not (= 32 |ULTIMATE.start_strtoul_#t~mem2|))} assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; {595#false} is VALID [2020-07-29 01:32:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:19,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251042075] [2020-07-29 01:32:19,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:19,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:32:19,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67829801] [2020-07-29 01:32:19,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:32:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:32:19,696 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2020-07-29 01:32:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:20,540 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2020-07-29 01:32:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:32:20,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:32:20,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:20,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2020-07-29 01:32:20,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-07-29 01:32:20,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2020-07-29 01:32:20,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2020-07-29 01:32:20,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2020-07-29 01:32:20,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2020-07-29 01:32:20,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:20,572 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2020-07-29 01:32:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2020-07-29 01:32:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2020-07-29 01:32:20,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:20,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states and 112 transitions. Second operand 38 states. [2020-07-29 01:32:20,576 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states and 112 transitions. Second operand 38 states. [2020-07-29 01:32:20,576 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 38 states. [2020-07-29 01:32:20,577 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,581 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2020-07-29 01:32:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2020-07-29 01:32:20,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,583 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 77 states and 112 transitions. [2020-07-29 01:32:20,583 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 77 states and 112 transitions. [2020-07-29 01:32:20,583 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,588 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2020-07-29 01:32:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2020-07-29 01:32:20,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:20,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:32:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2020-07-29 01:32:20,592 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2020-07-29 01:32:20,592 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2020-07-29 01:32:20,592 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:32:20,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2020-07-29 01:32:20,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 01:32:20,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,593 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:20,593 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:32:20,594 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 692#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 693#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 704#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 698#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 700#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 717#L555 assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 718#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 701#L512-3 [2020-07-29 01:32:20,594 INFO L796 eck$LassoCheckResult]: Loop: 701#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 702#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 701#L512-3 [2020-07-29 01:32:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2020-07-29 01:32:20,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105128215] [2020-07-29 01:32:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2020-07-29 01:32:20,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147630198] [2020-07-29 01:32:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2020-07-29 01:32:20,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751513820] [2020-07-29 01:32:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:21,532 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 148 [2020-07-29 01:32:21,854 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-29 01:32:21,857 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:21,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:21,858 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:21,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:21,858 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:21,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:21,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:21,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:21,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: strtol.i_Iteration3_Lasso [2020-07-29 01:32:21,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:21,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:21,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:21,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,515 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2020-07-29 01:32:22,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32: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 [2020-07-29 01:32:22,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32: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 [2020-07-29 01:32:22,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:22,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:23,555 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-07-29 01:32:24,364 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:24,364 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:24,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:24,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:24,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:24,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:24,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:24,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:24,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:24,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:24,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:24,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:24,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:24,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:24,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:24,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:24,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:24,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:24,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:25,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:25,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:25,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:25,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:25,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:25,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:25,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:25,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:25,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:25,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:25,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:25,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:25,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:25,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:25,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:25,705 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:32:25,705 INFO L444 ModelExtractionUtils]: 22 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:25,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:25,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:25,711 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:25,711 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_main_~in~0.base)_1) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~in~0.base)_1 Supporting invariants [] [2020-07-29 01:32:25,806 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-07-29 01:32:25,811 INFO L393 LassoCheck]: Loop: "call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1);" "assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset;" [2020-07-29 01:32:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:25,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:25,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:32:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:25,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:25,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {1003#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1003#unseeded} is VALID [2020-07-29 01:32:25,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#unseeded} havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; {1003#unseeded} is VALID [2020-07-29 01:32:25,918 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#unseeded} assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} is VALID [2020-07-29 01:32:25,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} is VALID [2020-07-29 01:32:25,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} is VALID [2020-07-29 01:32:25,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} is VALID [2020-07-29 01:32:25,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} is VALID [2020-07-29 01:32:25,922 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#(and (= ULTIMATE.start_strtol_~nptr.base ULTIMATE.start_main_~in~0.base) unseeded)} strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; {1082#(and unseeded (= ULTIMATE.start_strtoul_~nptr~0.base ULTIMATE.start_main_~in~0.base))} is VALID [2020-07-29 01:32:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:25,930 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:25,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_strtoul_~nptr~0.offset) (select |#length| ULTIMATE.start_main_~in~0.base))) (= ULTIMATE.start_strtoul_~nptr~0.base ULTIMATE.start_main_~in~0.base))} call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); {1113#(and (<= (+ ULTIMATE.start_strtoul_~nptr~0.offset 1) (select |#length| ULTIMATE.start_strtoul_~nptr~0.base)) (<= (select |#length| ULTIMATE.start_main_~in~0.base) (+ oldRank0 ULTIMATE.start_strtoul_~nptr~0.offset)) (= ULTIMATE.start_strtoul_~nptr~0.base ULTIMATE.start_main_~in~0.base))} is VALID [2020-07-29 01:32:25,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1113#(and (<= (+ ULTIMATE.start_strtoul_~nptr~0.offset 1) (select |#length| ULTIMATE.start_strtoul_~nptr~0.base)) (<= (select |#length| ULTIMATE.start_main_~in~0.base) (+ oldRank0 ULTIMATE.start_strtoul_~nptr~0.offset)) (= ULTIMATE.start_strtoul_~nptr~0.base ULTIMATE.start_main_~in~0.base))} assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; {1085#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_strtoul_~nptr~0.offset) (select |#length| ULTIMATE.start_main_~in~0.base))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_strtoul_~nptr~0.base ULTIMATE.start_main_~in~0.base))} is VALID [2020-07-29 01:32:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:25,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:32:25,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:25,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:25,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:25,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:32:25,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-07-29 01:32:26,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 77 states and 110 transitions. Complement of second has 7 states. [2020-07-29 01:32:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:26,273 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:26,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. cyclomatic complexity: 18 [2020-07-29 01:32:26,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:26,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:26,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:32:26,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:26,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:26,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:26,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 110 transitions. [2020-07-29 01:32:26,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:26,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:26,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 18 [2020-07-29 01:32:26,280 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 01:32:26,282 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:32:26,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:26,284 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:26,284 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 110 transitions. cyclomatic complexity: 36 [2020-07-29 01:32:26,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 110 transitions. cyclomatic complexity: 36 [2020-07-29 01:32:26,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:26,285 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:32:26,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:32:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:32:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:32:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:32:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:32:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:32:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 5 letters. [2020-07-29 01:32:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 5 letters. [2020-07-29 01:32:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 7 letters. [2020-07-29 01:32:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:32:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:32:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 5 letters. [2020-07-29 01:32:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 5 letters. [2020-07-29 01:32:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 9 letters. [2020-07-29 01:32:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:26,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 9 letters. [2020-07-29 01:32:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 110 transitions. cyclomatic complexity: 36 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,307 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:32:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-29 01:32:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:32:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:26,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. cyclomatic complexity: 36 [2020-07-29 01:32:26,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:26,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2020-07-29 01:32:26,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:32:26,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:32:26,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:32:26,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:26,316 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:26,316 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:26,317 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:26,317 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:32:26,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:32:26,317 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:26,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:26,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:32:26 BoogieIcfgContainer [2020-07-29 01:32:26,325 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:32:26,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:32:26,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:32:26,326 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:32:26,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:14" (3/4) ... [2020-07-29 01:32:26,329 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:32:26,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:32:26,331 INFO L168 Benchmark]: Toolchain (without parser) took 13800.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -247.3 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:26,331 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:26,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:26,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:26,333 INFO L168 Benchmark]: Boogie Preprocessor took 62.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:26,333 INFO L168 Benchmark]: RCFGBuilder took 833.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:26,334 INFO L168 Benchmark]: BuchiAutomizer took 12170.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.6 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:26,334 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:26,337 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 833.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12170.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.6 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[in] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 9.1s. Construction of modules took 0.5s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 162 SDtfs, 217 SDslu, 292 SDs, 0 SdLazy, 233 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax100 hnf100 lsp90 ukn67 mio100 lsp36 div100 bol100 ite100 ukn100 eq188 hnf88 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...