./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/loop-lit/cggmp2005b.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 36ea3dac680e51d6ad6f865bd27e54e77972f8c9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:08:03,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:08:03,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:08:03,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:08:03,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:08:03,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:08:03,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:08:03,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:08:03,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:08:03,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:08:03,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:08:03,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:08:03,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:08:03,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:08:03,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:08:03,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:08:03,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:08:03,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:08:03,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:08:03,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:08:03,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:08:03,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:08:03,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:08:03,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:08:03,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:08:03,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:08:03,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:08:03,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:08:03,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:08:03,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:08:03,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:08:03,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:08:03,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:08:03,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:08:03,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:08:03,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:08:03,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:08:03,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:08:03,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:08:03,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:08:03,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:08:03,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:08:03,254 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:08:03,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:08:03,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:08:03,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:08:03,256 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:08:03,257 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:08:03,257 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:08:03,257 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:08:03,257 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:08:03,257 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:08:03,258 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:08:03,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:08:03,258 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:08:03,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:08:03,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:08:03,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:08:03,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:08:03,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:08:03,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:08:03,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:08:03,260 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:08:03,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:08:03,260 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:08:03,260 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:08:03,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:08:03,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:08:03,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:08:03,261 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:08:03,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:08:03,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:08:03,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:08:03,262 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:08:03,263 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:08:03,263 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36ea3dac680e51d6ad6f865bd27e54e77972f8c9 [2020-07-29 02:08:03,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:08:03,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:08:03,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:08:03,587 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:08:03,588 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:08:03,590 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2020-07-29 02:08:03,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8080943ae/96d213166a4d4b66ad8ad4ea686f313a/FLAGd43e6eaba [2020-07-29 02:08:04,117 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:08:04,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2020-07-29 02:08:04,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8080943ae/96d213166a4d4b66ad8ad4ea686f313a/FLAGd43e6eaba [2020-07-29 02:08:04,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8080943ae/96d213166a4d4b66ad8ad4ea686f313a [2020-07-29 02:08:04,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:08:04,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:08:04,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:04,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:08:04,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:08:04,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704479f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04, skipping insertion in model container [2020-07-29 02:08:04,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:08:04,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:08:04,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:04,719 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:08:04,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:04,749 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:08:04,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04 WrapperNode [2020-07-29 02:08:04,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:04,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:04,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:08:04,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:08:04,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:04,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:08:04,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:08:04,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:08:04,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (1/1) ... [2020-07-29 02:08:04,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:08:04,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:08:04,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:08:04,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:08:04,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (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 02:08:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:08:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:08:05,220 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:08:05,221 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 02:08:05,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:05 BoogieIcfgContainer [2020-07-29 02:08:05,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:08:05,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:08:05,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:08:05,238 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:08:05,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:05,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:08:04" (1/3) ... [2020-07-29 02:08:05,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3c8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:05, skipping insertion in model container [2020-07-29 02:08:05,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:05,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:04" (2/3) ... [2020-07-29 02:08:05,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a3c8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:05, skipping insertion in model container [2020-07-29 02:08:05,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:05,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:05" (3/3) ... [2020-07-29 02:08:05,243 INFO L371 chiAutomizerObserver]: Analyzing ICFG cggmp2005b.i [2020-07-29 02:08:05,294 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:08:05,294 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:08:05,294 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:08:05,294 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:08:05,295 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:08:05,295 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:08:05,295 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:08:05,295 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:08:05,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 02:08:05,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:05,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:05,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:05,332 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:08:05,333 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:08:05,333 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:08:05,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 02:08:05,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:05,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:05,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:05,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:08:05,337 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:08:05,343 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 3#L24-3true [2020-07-29 02:08:05,344 INFO L796 eck$LassoCheckResult]: Loop: 3#L24-3true assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 11#L20-2true assume !(main_~j~0 < 20); 8#L20-3true main_~k~0 := 4; 7#L24-2true assume !true; 3#L24-3true [2020-07-29 02:08:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 02:08:05,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:05,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082014113] [2020-07-29 02:08:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1238515, now seen corresponding path program 1 times [2020-07-29 02:08:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:05,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593092860] [2020-07-29 02:08:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:05,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {18#true} is VALID [2020-07-29 02:08:05,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#true} assume !(main_~j~0 < 20); {18#true} is VALID [2020-07-29 02:08:05,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} main_~k~0 := 4; {18#true} is VALID [2020-07-29 02:08:05,478 INFO L280 TraceCheckUtils]: 3: Hoare triple {18#true} assume !true; {19#false} is VALID [2020-07-29 02:08:05,479 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 02:08:05,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593092860] [2020-07-29 02:08:05,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:08:05,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-29 02:08:05,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536884458] [2020-07-29 02:08:05,487 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 02:08:05,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 02:08:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 02:08:05,499 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-29 02:08:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:05,533 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 02:08:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:08:05,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:08:05,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:05,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 02:08:05,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:05,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 5 states and 7 transitions. [2020-07-29 02:08:05,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:05,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 02:08:05,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7 transitions. [2020-07-29 02:08:05,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:05,564 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 02:08:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 7 transitions. [2020-07-29 02:08:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-29 02:08:05,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:05,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 7 transitions. Second operand 5 states. [2020-07-29 02:08:05,590 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 7 transitions. Second operand 5 states. [2020-07-29 02:08:05,591 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 5 states. [2020-07-29 02:08:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:05,592 INFO L93 Difference]: Finished difference Result 5 states and 7 transitions. [2020-07-29 02:08:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2020-07-29 02:08:05,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:05,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:05,594 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states and 7 transitions. [2020-07-29 02:08:05,594 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states and 7 transitions. [2020-07-29 02:08:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:05,595 INFO L93 Difference]: Finished difference Result 5 states and 7 transitions. [2020-07-29 02:08:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2020-07-29 02:08:05,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:05,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:05,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:05,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 02:08:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-07-29 02:08:05,598 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 02:08:05,598 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 02:08:05,598 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:08:05,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2020-07-29 02:08:05,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:05,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:05,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:05,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:08:05,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:08:05,600 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 32#L24-3 [2020-07-29 02:08:05,600 INFO L796 eck$LassoCheckResult]: Loop: 32#L24-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 33#L20-2 assume !(main_~j~0 < 20); 36#L20-3 main_~k~0 := 4; 35#L24-2 assume !(main_~k~0 <= 3); 32#L24-3 [2020-07-29 02:08:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 02:08:05,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:05,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001114916] [2020-07-29 02:08:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:05,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1238511, now seen corresponding path program 1 times [2020-07-29 02:08:05,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:05,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858853553] [2020-07-29 02:08:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:05,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:05,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29867662, now seen corresponding path program 1 times [2020-07-29 02:08:05,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:05,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732710272] [2020-07-29 02:08:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:05,681 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {56#(<= (+ ULTIMATE.start_main_~j~0 100) 0)} is VALID [2020-07-29 02:08:05,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(<= (+ ULTIMATE.start_main_~j~0 100) 0)} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {56#(<= (+ ULTIMATE.start_main_~j~0 100) 0)} is VALID [2020-07-29 02:08:05,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {56#(<= (+ ULTIMATE.start_main_~j~0 100) 0)} assume !(main_~j~0 < 20); {55#false} is VALID [2020-07-29 02:08:05,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {55#false} main_~k~0 := 4; {55#false} is VALID [2020-07-29 02:08:05,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {55#false} assume !(main_~k~0 <= 3); {55#false} is VALID [2020-07-29 02:08:05,685 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 02:08:05,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732710272] [2020-07-29 02:08:05,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:08:05,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 02:08:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812364960] [2020-07-29 02:08:05,758 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:05,759 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:05,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:05,759 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:05,760 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:05,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:05,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:05,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:05,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2020-07-29 02:08:05,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:05,761 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:05,792 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 02:08:05,803 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 02:08:05,822 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 02:08:05,934 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:05,935 INFO L404 LassoAnalysis]: Checking for nontermination... 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 02:08:05,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:05,950 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:05,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:05,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=20} Honda state: {ULTIMATE.start_main_~j~0=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 02:08:06,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:06,005 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 02:08:06,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:06,044 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:06,081 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:06,083 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:06,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:06,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:06,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:06,084 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:06,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:06,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:06,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:06,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2020-07-29 02:08:06,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:06,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:06,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 02:08:06,098 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 02:08:06,108 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 02:08:06,204 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:06,209 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:08:06,213 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 02:08:06,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:06,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:06,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:06,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:06,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:06,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:06,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:06,230 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 02:08:06,266 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 02:08:06,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:06,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:06,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:06,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:06,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:06,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:06,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:06,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:06,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:06,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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 02:08:06,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:06,283 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:06,284 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:06,284 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 201 Supporting invariants [] [2020-07-29 02:08:06,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:06,332 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0;" "assume !(main_~j~0 < 20);" "main_~k~0 := 4;" "assume !(main_~k~0 <= 3);" [2020-07-29 02:08:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:06,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:06,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:06,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {57#unseeded} is VALID [2020-07-29 02:08:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:06,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:06,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:06,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 201))} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 02:08:06,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !(main_~j~0 < 20); {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 02:08:06,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} main_~k~0 := 4; {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2020-07-29 02:08:06,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !(main_~k~0 <= 3); {70#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 201))) unseeded)} is VALID [2020-07-29 02:08:06,558 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 02:08:06,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:06,566 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 02:08:06,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,571 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 02:08:06,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 02:08:06,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 4 states. [2020-07-29 02:08:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:06,624 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:06,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 02:08:06,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:06,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:06,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:06,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:06,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:06,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:06,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 02:08:06,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:08:06,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:06,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:06,632 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 02:08:06,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:08:06,633 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:06,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:06,635 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:06,635 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:06,635 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:08:06,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:08:06,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:08:06,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:08:06,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:06,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:06,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:06,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:06,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:06,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:06,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:06,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:08:06,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:08:06,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:08:06,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:06,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:06,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,652 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:08:06,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:08:06,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:06,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-29 02:08:06,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:06,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:06,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:08:06,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 19 transitions. [2020-07-29 02:08:06,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:06,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 02:08:06,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2020-07-29 02:08:06,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:06,661 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-07-29 02:08:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2020-07-29 02:08:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2020-07-29 02:08:06,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:06,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 19 transitions. Second operand 10 states. [2020-07-29 02:08:06,663 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 19 transitions. Second operand 10 states. [2020-07-29 02:08:06,663 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 10 states. [2020-07-29 02:08:06,664 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:06,667 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-07-29 02:08:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. [2020-07-29 02:08:06,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:06,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:06,668 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 12 states and 19 transitions. [2020-07-29 02:08:06,668 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 12 states and 19 transitions. [2020-07-29 02:08:06,669 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:06,674 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-07-29 02:08:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2020-07-29 02:08:06,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:06,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:06,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:06,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 02:08:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-07-29 02:08:06,677 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-07-29 02:08:06,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 02:08:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 02:08:06,678 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2020-07-29 02:08:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:06,696 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2020-07-29 02:08:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 02:08:06,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:06,704 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 02:08:06,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:08:06,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 18 transitions. [2020-07-29 02:08:06,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:06,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 02:08:06,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:06,709 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-29 02:08:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 02:08:06,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:06,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 18 transitions. Second operand 11 states. [2020-07-29 02:08:06,710 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 18 transitions. Second operand 11 states. [2020-07-29 02:08:06,711 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 11 states. [2020-07-29 02:08:06,711 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:06,713 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2020-07-29 02:08:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:06,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:06,714 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 18 transitions. [2020-07-29 02:08:06,714 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 18 transitions. [2020-07-29 02:08:06,714 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:06,716 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2020-07-29 02:08:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:06,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:06,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:06,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 02:08:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-07-29 02:08:06,718 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-29 02:08:06,719 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-29 02:08:06,719 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:08:06,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. [2020-07-29 02:08:06,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:08:06,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:06,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:06,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:08:06,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 02:08:06,721 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 179#L24-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 180#L20-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 188#L20-2 [2020-07-29 02:08:06,721 INFO L796 eck$LassoCheckResult]: Loop: 188#L20-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 188#L20-2 [2020-07-29 02:08:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 02:08:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:06,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892173641] [2020-07-29 02:08:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 02:08:06,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:06,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516956941] [2020-07-29 02:08:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,742 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2020-07-29 02:08:06,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:06,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068253018] [2020-07-29 02:08:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:06,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:06,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:06,835 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:06,835 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:06,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:06,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:06,835 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:06,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:06,836 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:06,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:06,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Lasso [2020-07-29 02:08:06,836 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:06,836 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:06,844 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 02:08:06,851 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 02:08:06,866 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 02:08:06,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:06,976 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 02:08:06,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:06,980 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:06,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:06,984 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0} Honda state: {ULTIMATE.start_main_~k~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 02:08:07,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:07,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 02:08:07,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:07,088 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:07,972 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:07,976 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:07,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:07,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:07,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:07,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:07,977 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:07,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:07,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:07,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Lasso [2020-07-29 02:08:07,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:07,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:07,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 02:08:07,994 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 02:08:08,007 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 02:08:08,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:08,113 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 02:08:08,128 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 02:08:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:08,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:08,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:08,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:08,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:08,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:08,143 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 02:08:08,188 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 02:08:08,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:08,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:08,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:08,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:08,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:08,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:08,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:08,215 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 02:08:08,215 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. 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) [2020-07-29 02:08:08,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:08,233 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 02:08:08,233 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:08,234 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 39 Supporting invariants [1*ULTIMATE.start_main_~i~0 - 1 >= 0] [2020-07-29 02:08:08,269 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 02:08:08,281 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0;" [2020-07-29 02:08:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:08,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {275#(and (<= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 02:08:08,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {275#(and (<= 0 ULTIMATE.start_main_~i~0) unseeded)} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {266#(and (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 02:08:08,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {266#(and (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {266#(and (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 02:08:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,384 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:08:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:08,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {267#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 39)) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0))} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {269#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 39)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~i~0 (- 1)) 0))} is VALID [2020-07-29 02:08:08,390 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 02:08:08,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:08,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2020-07-29 02:08:08,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 18 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-07-29 02:08:08,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 18 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 20 states and 33 transitions. Complement of second has 6 states. [2020-07-29 02:08:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:08,472 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:08,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:08,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:08,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:08,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:08,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:08,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:08,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:08,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 33 transitions. [2020-07-29 02:08:08,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:08,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:08,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:08,476 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 18 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:08,477 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:08:08,477 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:08,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:08,478 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:08,478 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 33 transitions. cyclomatic complexity: 18 [2020-07-29 02:08:08,479 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2020-07-29 02:08:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 02:08:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2020-07-29 02:08:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 33 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:08,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,490 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-07-29 02:08:08,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:08:08,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 02:08:08,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:08,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:08,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 33 transitions. cyclomatic complexity: 18 [2020-07-29 02:08:08,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:08,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 27 transitions. [2020-07-29 02:08:08,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:08,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 02:08:08,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 27 transitions. [2020-07-29 02:08:08,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:08,497 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-07-29 02:08:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 27 transitions. [2020-07-29 02:08:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 02:08:08,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:08,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 27 transitions. Second operand 16 states. [2020-07-29 02:08:08,499 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 27 transitions. Second operand 16 states. [2020-07-29 02:08:08,499 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 16 states. [2020-07-29 02:08:08,499 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:08,501 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. [2020-07-29 02:08:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2020-07-29 02:08:08,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:08,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:08,502 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 27 transitions. [2020-07-29 02:08:08,502 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 27 transitions. [2020-07-29 02:08:08,503 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:08,505 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2020-07-29 02:08:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-07-29 02:08:08,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:08,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:08,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:08,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 02:08:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-29 02:08:08,507 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-29 02:08:08,507 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-29 02:08:08,508 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:08:08,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 26 transitions. [2020-07-29 02:08:08,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:08,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:08,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:08,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:08:08,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 02:08:08,509 INFO L794 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 313#L24-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 314#L20-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 322#L20-2 assume !(main_~j~0 < 20); 320#L20-3 main_~k~0 := 4; 318#L24-2 [2020-07-29 02:08:08,509 INFO L796 eck$LassoCheckResult]: Loop: 318#L24-2 assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; 318#L24-2 [2020-07-29 02:08:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:08,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29869391, now seen corresponding path program 1 times [2020-07-29 02:08:08,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:08,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087649788] [2020-07-29 02:08:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {399#true} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {401#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 100) 0)} is VALID [2020-07-29 02:08:08,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 100) 0)} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {402#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 99) 0)} is VALID [2020-07-29 02:08:08,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 99) 0)} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {403#(<= (+ ULTIMATE.start_main_~j~0 99) 0)} is VALID [2020-07-29 02:08:08,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#(<= (+ ULTIMATE.start_main_~j~0 99) 0)} assume !(main_~j~0 < 20); {400#false} is VALID [2020-07-29 02:08:08,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {400#false} main_~k~0 := 4; {400#false} is VALID [2020-07-29 02:08:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:08,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087649788] [2020-07-29 02:08:08,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257455797] [2020-07-29 02:08:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:08:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:08:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:08,747 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-29 02:08:08,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {399#true} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {407#(and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~j~0 100) 0))} is VALID [2020-07-29 02:08:08,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~j~0 100) 0))} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {411#(and (<= (+ ULTIMATE.start_main_~j~0 100) 0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:08:08,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {411#(and (<= (+ ULTIMATE.start_main_~j~0 100) 0) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {403#(<= (+ ULTIMATE.start_main_~j~0 99) 0)} is VALID [2020-07-29 02:08:08,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#(<= (+ ULTIMATE.start_main_~j~0 99) 0)} assume !(main_~j~0 < 20); {400#false} is VALID [2020-07-29 02:08:08,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {400#false} main_~k~0 := 4; {400#false} is VALID [2020-07-29 02:08:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:08,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:08:08,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-29 02:08:08,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282748236] [2020-07-29 02:08:08,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:08:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2020-07-29 02:08:08,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:08,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778929609] [2020-07-29 02:08:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:08,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:08,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:08,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:08,840 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:08,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:08,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:08,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:08,840 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:08,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:08,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:08,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:08,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2020-07-29 02:08:08,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:08,841 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:08,844 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 02:08:08,881 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:08,881 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 02:08:08,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:08,885 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:08,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:08,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:08:08,967 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:08,969 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:08,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:08,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:08,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:08,970 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:08,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:08,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:08,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:08,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2020-07-29 02:08:08,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:08,971 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:08,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 02:08:09,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:09,009 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:08:09,024 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 02:08:09,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:09,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:09,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:09,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:09,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:09,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:09,028 INFO L402 nArgumentSynthesizer]: A total of 0 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 02:08:09,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:09,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:09,035 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 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) [2020-07-29 02:08:09,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:09,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:09,046 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:09,047 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 7 Supporting invariants [] Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:09,081 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:09,083 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0;" [2020-07-29 02:08:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {420#unseeded} is VALID [2020-07-29 02:08:09,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {420#unseeded} is VALID [2020-07-29 02:08:09,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {420#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {420#unseeded} is VALID [2020-07-29 02:08:09,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {420#unseeded} assume !(main_~j~0 < 20); {420#unseeded} is VALID [2020-07-29 02:08:09,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {420#unseeded} main_~k~0 := 4; {420#unseeded} is VALID [2020-07-29 02:08:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,115 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {423#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7))} assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; {433#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:08:09,120 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 02:08:09,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:08:09,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 02:08:09,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 26 transitions. cyclomatic complexity: 14 Second operand 2 states. [2020-07-29 02:08:09,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 26 transitions. cyclomatic complexity: 14. Second operand 2 states. Result 47 states and 75 transitions. Complement of second has 5 states. [2020-07-29 02:08:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:09,162 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:09,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 26 transitions. cyclomatic complexity: 14 [2020-07-29 02:08:09,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 02:08:09,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 75 transitions. [2020-07-29 02:08:09,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,166 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 26 transitions. cyclomatic complexity: 14 [2020-07-29 02:08:09,167 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,167 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 02:08:09,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 75 transitions. cyclomatic complexity: 41 [2020-07-29 02:08:09,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:09,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:09,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:09,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:08:09,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:08:09,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:08:09,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 26 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 75 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 1 letters. [2020-07-29 02:08:09,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,176 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 02:08:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:08:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2020-07-29 02:08:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 02:08:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:08:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 75 transitions. cyclomatic complexity: 41 [2020-07-29 02:08:09,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 31 states and 51 transitions. [2020-07-29 02:08:09,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 02:08:09,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 02:08:09,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. [2020-07-29 02:08:09,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:09,183 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-07-29 02:08:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. [2020-07-29 02:08:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 16. [2020-07-29 02:08:09,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:09,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 51 transitions. Second operand 16 states. [2020-07-29 02:08:09,185 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 51 transitions. Second operand 16 states. [2020-07-29 02:08:09,185 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 16 states. [2020-07-29 02:08:09,186 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:09,189 INFO L93 Difference]: Finished difference Result 33 states and 57 transitions. [2020-07-29 02:08:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2020-07-29 02:08:09,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:09,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:09,190 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 31 states and 51 transitions. [2020-07-29 02:08:09,191 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 31 states and 51 transitions. [2020-07-29 02:08:09,191 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:09,194 INFO L93 Difference]: Finished difference Result 33 states and 57 transitions. [2020-07-29 02:08:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2020-07-29 02:08:09,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:09,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:09,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:09,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 02:08:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2020-07-29 02:08:09,196 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-07-29 02:08:09,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:09,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 02:08:09,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-29 02:08:09,198 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 7 states. [2020-07-29 02:08:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:09,264 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-07-29 02:08:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 02:08:09,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 02:08:09,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:09,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 26 transitions. [2020-07-29 02:08:09,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 26 transitions. [2020-07-29 02:08:09,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:09,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 02:08:09,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2020-07-29 02:08:09,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:09,280 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-07-29 02:08:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2020-07-29 02:08:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 02:08:09,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:09,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 26 transitions. Second operand 17 states. [2020-07-29 02:08:09,282 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 26 transitions. Second operand 17 states. [2020-07-29 02:08:09,282 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. Second operand 17 states. [2020-07-29 02:08:09,282 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:09,284 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-29 02:08:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-07-29 02:08:09,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:09,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:09,285 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 26 transitions. [2020-07-29 02:08:09,285 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 26 transitions. [2020-07-29 02:08:09,285 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:09,287 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-29 02:08:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-07-29 02:08:09,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:09,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:09,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:09,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 02:08:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-07-29 02:08:09,289 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-07-29 02:08:09,289 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-07-29 02:08:09,290 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 02:08:09,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-07-29 02:08:09,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2020-07-29 02:08:09,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 02:08:09,291 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 646#L24-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 647#L20-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 658#L20-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 660#L20-2 assume !(main_~j~0 < 20); 662#L20-3 main_~k~0 := 4; 661#L24-2 assume !(main_~k~0 <= 3); 648#L24-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 649#L20-2 assume !(main_~j~0 < 20); 654#L20-3 main_~k~0 := 4; 651#L24-2 [2020-07-29 02:08:09,291 INFO L796 eck$LassoCheckResult]: Loop: 651#L24-2 assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; 651#L24-2 [2020-07-29 02:08:09,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 352026178, now seen corresponding path program 1 times [2020-07-29 02:08:09,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:09,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243822335] [2020-07-29 02:08:09,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {754#(<= (+ (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0 100) 0)} is VALID [2020-07-29 02:08:09,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {754#(<= (+ (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0 100) 0)} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {755#(<= (+ (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0 98) 0)} is VALID [2020-07-29 02:08:09,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {755#(<= (+ (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0 98) 0)} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {756#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 98) 0)} is VALID [2020-07-29 02:08:09,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {756#(<= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 98) 0)} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {757#(<= (+ ULTIMATE.start_main_~j~0 98) 0)} is VALID [2020-07-29 02:08:09,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {757#(<= (+ ULTIMATE.start_main_~j~0 98) 0)} assume !(main_~j~0 < 20); {753#false} is VALID [2020-07-29 02:08:09,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#false} main_~k~0 := 4; {753#false} is VALID [2020-07-29 02:08:09,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#false} assume !(main_~k~0 <= 3); {753#false} is VALID [2020-07-29 02:08:09,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {753#false} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {753#false} is VALID [2020-07-29 02:08:09,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {753#false} assume !(main_~j~0 < 20); {753#false} is VALID [2020-07-29 02:08:09,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#false} main_~k~0 := 4; {753#false} is VALID [2020-07-29 02:08:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 02:08:09,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243822335] [2020-07-29 02:08:09,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325922260] [2020-07-29 02:08:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 02:08:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:08:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {761#(and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~j~0 100) 0))} is VALID [2020-07-29 02:08:09,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {761#(and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~j~0 100) 0))} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {765#(and (<= (+ ULTIMATE.start_main_~j~0 100) 0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:08:09,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(and (<= (+ ULTIMATE.start_main_~j~0 100) 0) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {769#(and (<= (+ ULTIMATE.start_main_~j~0 100) ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:08:09,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {769#(and (<= (+ ULTIMATE.start_main_~j~0 100) ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {757#(<= (+ ULTIMATE.start_main_~j~0 98) 0)} is VALID [2020-07-29 02:08:09,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {757#(<= (+ ULTIMATE.start_main_~j~0 98) 0)} assume !(main_~j~0 < 20); {753#false} is VALID [2020-07-29 02:08:09,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#false} main_~k~0 := 4; {753#false} is VALID [2020-07-29 02:08:09,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#false} assume !(main_~k~0 <= 3); {753#false} is VALID [2020-07-29 02:08:09,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {753#false} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {753#false} is VALID [2020-07-29 02:08:09,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {753#false} assume !(main_~j~0 < 20); {753#false} is VALID [2020-07-29 02:08:09,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#false} main_~k~0 := 4; {753#false} is VALID [2020-07-29 02:08:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 02:08:09,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:08:09,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-29 02:08:09,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926401056] [2020-07-29 02:08:09,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:08:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 2 times [2020-07-29 02:08:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:09,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639228281] [2020-07-29 02:08:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:09,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:09,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:09,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:09,619 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:09,619 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:09,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:09,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:09,620 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:09,620 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:09,620 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:09,620 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:09,620 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration5_Loop [2020-07-29 02:08:09,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:09,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:09,626 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 02:08:09,662 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:09,662 INFO L404 LassoAnalysis]: Checking for nontermination... 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 02:08:09,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:09,666 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 02:08:09,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:09,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:08:09,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:09,728 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:09,728 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:09,728 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:09,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:09,728 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:09,729 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:09,729 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:09,729 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:09,729 INFO L133 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration5_Loop [2020-07-29 02:08:09,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:09,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:09,735 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 02:08:09,772 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:09,772 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:08:09,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 02:08:09,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:09,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:09,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:09,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:09,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:09,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:09,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:09,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:09,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:09,791 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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 02:08:09,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:09,795 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:09,795 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:09,795 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 7 Supporting invariants [] [2020-07-29 02:08:09,826 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:09,829 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0;" [2020-07-29 02:08:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {790#unseeded} is VALID [2020-07-29 02:08:09,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:09,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:09,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:09,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:09,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:09,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {790#unseeded} assume !(main_~k~0 <= 3); {790#unseeded} is VALID [2020-07-29 02:08:09,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:09,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:09,865 INFO L280 TraceCheckUtils]: 9: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,868 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {793#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7))} assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; {803#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:08:09,874 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 02:08:09,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:08:09,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:09,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 02:08:09,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 02:08:09,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 43 states and 68 transitions. Complement of second has 5 states. [2020-07-29 02:08:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:09,908 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:09,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:09,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 02:08:09,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 68 transitions. [2020-07-29 02:08:09,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:09,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:09,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:09,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 02:08:09,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:09,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,914 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 68 transitions. cyclomatic complexity: 36 [2020-07-29 02:08:09,914 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:09,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:09,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:09,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:09,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:09,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:09,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:09,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:09,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,925 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 02:08:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:08:09,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,926 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {790#unseeded} is VALID [2020-07-29 02:08:09,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:09,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:09,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:09,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:09,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:09,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {790#unseeded} assume !(main_~k~0 <= 3); {790#unseeded} is VALID [2020-07-29 02:08:09,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:09,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:09,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,962 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:09,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:09,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {793#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7))} assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; {803#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:08:09,965 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 02:08:09,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:08:09,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:09,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:09,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:09,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 02:08:09,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 02:08:10,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 43 states and 68 transitions. Complement of second has 5 states. [2020-07-29 02:08:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:10,007 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:10,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:10,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 02:08:10,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:10,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 68 transitions. [2020-07-29 02:08:10,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:10,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,009 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:10,010 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:10,010 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 02:08:10,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:10,013 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:10,014 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 68 transitions. cyclomatic complexity: 36 [2020-07-29 02:08:10,014 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:08:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 68 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,025 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 02:08:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:08:10,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,027 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:10,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:10,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:10,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; {790#unseeded} is VALID [2020-07-29 02:08:10,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:10,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:10,061 INFO L280 TraceCheckUtils]: 3: Hoare triple {790#unseeded} assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; {790#unseeded} is VALID [2020-07-29 02:08:10,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:10,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:10,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {790#unseeded} assume !(main_~k~0 <= 3); {790#unseeded} is VALID [2020-07-29 02:08:10,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {790#unseeded} assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; {790#unseeded} is VALID [2020-07-29 02:08:10,068 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#unseeded} assume !(main_~j~0 < 20); {790#unseeded} is VALID [2020-07-29 02:08:10,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {790#unseeded} main_~k~0 := 4; {790#unseeded} is VALID [2020-07-29 02:08:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:10,072 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:10,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:10,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {793#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7))} assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; {803#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) 7)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:08:10,078 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 02:08:10,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:08:10,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:10,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,086 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 02:08:10,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 02:08:10,121 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 32 states and 48 transitions. Complement of second has 4 states. [2020-07-29 02:08:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:10,121 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:10,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:10,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 02:08:10,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:10,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 48 transitions. [2020-07-29 02:08:10,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:10,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:10,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 26 transitions. cyclomatic complexity: 13 [2020-07-29 02:08:10,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:10,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 02:08:10,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 02:08:10,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:10,125 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 48 transitions. cyclomatic complexity: 23 [2020-07-29 02:08:10,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 48 transitions. cyclomatic complexity: 23 [2020-07-29 02:08:10,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:10,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2020-07-29 02:08:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 02:08:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 32 letters. [2020-07-29 02:08:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:08:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 26 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 48 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:08:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,132 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 02:08:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-29 02:08:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 1 letters. [2020-07-29 02:08:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 1 letters. [2020-07-29 02:08:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:08:10,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:10,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. cyclomatic complexity: 23 [2020-07-29 02:08:10,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:10,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2020-07-29 02:08:10,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:10,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:10,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:10,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:10,136 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:10,136 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:10,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 02:08:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-07-29 02:08:10,137 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2020-07-29 02:08:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:10,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:08:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:08:10,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 02:08:10,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:10,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:08:10,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:10,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:08:10,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:10,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:10,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:10,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:10,153 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:10,153 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:10,153 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:10,153 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 02:08:10,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:08:10,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:10,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:10,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:08:10 BoogieIcfgContainer [2020-07-29 02:08:10,160 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:08:10,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:08:10,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:08:10,161 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:08:10,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:05" (3/4) ... [2020-07-29 02:08:10,164 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:08:10,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:08:10,167 INFO L168 Benchmark]: Toolchain (without parser) took 5657.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 961.6 MB in the beginning and 944.6 MB in the end (delta: 16.9 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:10,167 INFO L168 Benchmark]: CDTParser took 1.12 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 02:08:10,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:10,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:10,170 INFO L168 Benchmark]: Boogie Preprocessor took 92.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:10,170 INFO L168 Benchmark]: RCFGBuilder took 354.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:10,171 INFO L168 Benchmark]: BuchiAutomizer took 4930.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 944.6 MB in the end (delta: 135.3 MB). Peak memory consumption was 221.3 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:10,171 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:10,175 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 1.12 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 238.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 354.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4930.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 944.6 MB in the end (delta: 135.3 MB). Peak memory consumption was 221.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 201 and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 39 and consists of 5 locations. One deterministic module has affine ranking function -2 * k + 7 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * k + 7 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72 SDtfs, 57 SDslu, 30 SDs, 0 SdLazy, 42 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf98 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq167 hnf93 smp100 dnf100 smp100 tf109 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...