./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Piecewise.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/Piecewise.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 36155f521cfe170e9c03fd915618e68821fe0430 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:27:42,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:27:42,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:27:42,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:27:42,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:27:42,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:27:42,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:27:42,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:27:42,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:27:42,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:27:42,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:27:42,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:27:42,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:27:43,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:27:43,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:27:43,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:27:43,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:27:43,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:27:43,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:27:43,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:27:43,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:27:43,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:27:43,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:27:43,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:27:43,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:27:43,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:27:43,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:27:43,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:27:43,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:27:43,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:27:43,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:27:43,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:27:43,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:27:43,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:27:43,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:27:43,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:27:43,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:27:43,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:27:43,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:27:43,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:27:43,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:27:43,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:27:43,078 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:27:43,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:27:43,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:27:43,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:27:43,081 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:27:43,082 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:27:43,082 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:27:43,082 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:27:43,082 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:27:43,083 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:27:43,084 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:27:43,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:27:43,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:27:43,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:27:43,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:27:43,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:27:43,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:27:43,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:27:43,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:27:43,087 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:27:43,087 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:27:43,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:27:43,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:27:43,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:27:43,088 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:27:43,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:27:43,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:27:43,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:27:43,089 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:27:43,091 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:27:43,091 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36155f521cfe170e9c03fd915618e68821fe0430 [2020-07-29 01:27:43,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:27:43,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:27:43,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:27:43,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:27:43,460 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:27:43,461 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Piecewise.c [2020-07-29 01:27:43,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899c4297a/d5c4f2fe596a49cd93eb72deaec701cb/FLAGa864e5caa [2020-07-29 01:27:43,985 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:27:43,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Piecewise.c [2020-07-29 01:27:43,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899c4297a/d5c4f2fe596a49cd93eb72deaec701cb/FLAGa864e5caa [2020-07-29 01:27:44,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899c4297a/d5c4f2fe596a49cd93eb72deaec701cb [2020-07-29 01:27:44,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:27:44,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:27:44,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:44,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:27:44,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:27:44,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d665394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44, skipping insertion in model container [2020-07-29 01:27:44,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:27:44,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:27:44,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:44,591 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:27:44,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:44,624 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:27:44,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44 WrapperNode [2020-07-29 01:27:44,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:44,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:44,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:27:44,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:27:44,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:44,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:27:44,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:27:44,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:27:44,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... [2020-07-29 01:27:44,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:27:44,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:27:44,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:27:44,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:27:44,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:27:44,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:27:45,007 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:27:45,008 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:27:45,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:45 BoogieIcfgContainer [2020-07-29 01:27:45,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:27:45,013 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:27:45,013 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:27:45,017 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:27:45,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:45,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:27:44" (1/3) ... [2020-07-29 01:27:45,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6579eb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:45, skipping insertion in model container [2020-07-29 01:27:45,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:45,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:44" (2/3) ... [2020-07-29 01:27:45,021 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6579eb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:45, skipping insertion in model container [2020-07-29 01:27:45,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:45,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:45" (3/3) ... [2020-07-29 01:27:45,024 INFO L371 chiAutomizerObserver]: Analyzing ICFG Piecewise.c [2020-07-29 01:27:45,112 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:27:45,113 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:27:45,113 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:27:45,113 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:27:45,113 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:27:45,113 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:27:45,113 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:27:45,114 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:27:45,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:27:45,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:45,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:45,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:45,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:27:45,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:45,184 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:27:45,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:27:45,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:45,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:45,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:45,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:27:45,193 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:45,203 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L26-2true [2020-07-29 01:27:45,204 INFO L796 eck$LassoCheckResult]: Loop: 8#L26-2true assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 6#L23true assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L26-2true [2020-07-29 01:27:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:27:45,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:45,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678967730] [2020-07-29 01:27:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-07-29 01:27:45,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:45,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310920936] [2020-07-29 01:27:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-07-29 01:27:45,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:45,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951930231] [2020-07-29 01:27:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:45,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:45,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:45,465 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:45,466 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:45,467 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:45,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:45,467 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:45,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:45,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:45,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:45,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration1_Loop [2020-07-29 01:27:45,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:45,469 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:45,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:45,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:45,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:45,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:45,709 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 01:27:45,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:45,717 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 01:27:45,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:45,729 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:45,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:45,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:45,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:45,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:45,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:45,802 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:45,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:45,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:45,876 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:45,878 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:45,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:45,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:45,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:45,879 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:45,879 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:45,879 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:45,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:45,880 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration1_Loop [2020-07-29 01:27:45,880 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:45,880 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:45,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:45,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:45,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:46,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:46,061 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:27:46,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:46,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:46,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:46,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:46,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:46,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:46,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:46,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:46,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 01:27:46,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:46,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:46,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:46,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:46,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:46,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:46,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:46,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:46,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:46,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:46,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:46,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:46,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:46,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:46,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:46,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:46,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:46,206 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 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 01:27:46,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:46,212 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:46,212 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:46,213 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:46,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:46,262 INFO L393 LassoCheck]: Loop: "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:27:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:46,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#unseeded} is VALID [2020-07-29 01:27:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:46,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {36#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} is VALID [2020-07-29 01:27:46,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {31#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:46,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:46,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:46,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:46,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:27:46,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 8 states. [2020-07-29 01:27:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:46,510 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:46,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:27:46,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:46,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:46,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:46,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:46,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:46,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:46,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:46,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2020-07-29 01:27:46,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:27:46,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:46,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:46,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:27:46,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:46,524 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:46,524 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:46,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:46,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:27:46,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 48 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:46,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:27:46,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:27:46,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:27:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:27:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:46,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:46,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:46,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:46,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:46,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:46,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:46,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:46,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:46,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,554 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:27:46,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:46,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:46,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:46,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:46,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:46,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:27:46,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 13 states and 19 transitions. [2020-07-29 01:27:46,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:27:46,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:27:46,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-07-29 01:27:46,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:46,575 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:27:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-07-29 01:27:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:27:46,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:46,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:27:46,609 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:27:46,612 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-29 01:27:46,616 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:46,619 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:27:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:27:46,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:46,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:46,622 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 19 transitions. [2020-07-29 01:27:46,622 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 19 transitions. [2020-07-29 01:27:46,623 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:46,625 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-29 01:27:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:27:46,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:46,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:46,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:46,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:27:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-07-29 01:27:46,629 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-29 01:27:46,629 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-29 01:27:46,629 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:27:46,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2020-07-29 01:27:46,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:27:46,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:46,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:46,631 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:46,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:46,631 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 93#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 94#L23 [2020-07-29 01:27:46,631 INFO L796 eck$LassoCheckResult]: Loop: 94#L23 assume !(main_~q~0 < main_~p~0); 95#L26 assume !(main_~p~0 < main_~q~0); 98#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 94#L23 [2020-07-29 01:27:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:27:46,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:46,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276849084] [2020-07-29 01:27:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,643 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash 44836, now seen corresponding path program 1 times [2020-07-29 01:27:46,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:46,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601040451] [2020-07-29 01:27:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:46,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {159#true} assume !(main_~q~0 < main_~p~0); {161#(<= ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-29 01:27:46,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#(<= ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~q~0)} assume !(main_~p~0 < main_~q~0); {162#(= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0)} is VALID [2020-07-29 01:27:46,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {162#(= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {160#false} is VALID [2020-07-29 01:27:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:46,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601040451] [2020-07-29 01:27:46,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:46,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:27:46,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898915124] [2020-07-29 01:27:46,717 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:27:46,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:46,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:27:46,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:27:46,721 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:27:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:46,747 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:27:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:27:46,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:46,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:46,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 01:27:46,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:46,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-07-29 01:27:46,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:27:46,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:27:46,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-29 01:27:46,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:46,758 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:27:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-29 01:27:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:27:46,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:46,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:46,759 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:46,760 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:46,760 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:46,761 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:46,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:46,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:46,762 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:46,762 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:46,763 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:46,764 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:46,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:46,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:46,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:46,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:27:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:27:46,767 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:46,767 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:46,767 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:27:46,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:27:46,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:46,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:46,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:46,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:27:46,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:46,769 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 179#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 180#L23 assume !(main_~q~0 < main_~p~0); 176#L26 [2020-07-29 01:27:46,769 INFO L796 eck$LassoCheckResult]: Loop: 176#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 177#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 183#L23 assume !(main_~q~0 < main_~p~0); 176#L26 [2020-07-29 01:27:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:27:46,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:46,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815766556] [2020-07-29 01:27:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash 47414, now seen corresponding path program 1 times [2020-07-29 01:27:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:46,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686381964] [2020-07-29 01:27:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 925832530, now seen corresponding path program 1 times [2020-07-29 01:27:46,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:46,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925634805] [2020-07-29 01:27:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:46,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:46,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:46,869 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:46,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:46,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:46,870 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:46,870 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:46,870 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:46,870 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:46,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:46,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration3_Loop [2020-07-29 01:27:46,871 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:46,871 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:46,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:46,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:46,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:47,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:47,096 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:47,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:47,112 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:47,113 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:27:47,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:47,166 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:47,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:47,347 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:47,349 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:47,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:47,350 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:47,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:47,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:47,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:47,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:47,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration3_Loop [2020-07-29 01:27:47,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:47,352 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:47,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:47,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:47,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:47,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:47,552 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:47,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:47,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:47,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:47,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:47,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:47,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:47,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:47,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:47,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:47,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:47,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:47,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:47,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:47,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:47,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:47,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:47,641 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 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 01:27:47,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:47,645 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:47,645 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:47,646 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:47,690 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:47,694 INFO L393 LassoCheck]: Loop: "assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume !(main_~q~0 < main_~p~0);" [2020-07-29 01:27:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:47,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:47,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:47,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {234#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {234#unseeded} is VALID [2020-07-29 01:27:47,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {234#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {234#unseeded} is VALID [2020-07-29 01:27:47,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {234#unseeded} assume !(main_~q~0 < main_~p~0); {234#unseeded} is VALID [2020-07-29 01:27:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:47,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:47,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:47,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {258#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} is VALID [2020-07-29 01:27:47,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {262#(and (< 0 ULTIMATE.start_main_~p~0) (<= (+ ULTIMATE.start_main_~p~0 1) oldRank0))} is VALID [2020-07-29 01:27:47,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#(and (< 0 ULTIMATE.start_main_~p~0) (<= (+ ULTIMATE.start_main_~p~0 1) oldRank0))} assume !(main_~q~0 < main_~p~0); {247#(or (and (> oldRank0 ULTIMATE.start_main_~p~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:47,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:47,853 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 01:27:47,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:47,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:47,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:27:47,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:27:48,001 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 16 states and 20 transitions. Complement of second has 7 states. [2020-07-29 01:27:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:48,002 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:48,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:48,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:48,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:27:48,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:48,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:48,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:48,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:48,007 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 01:27:48,008 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:48,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:48,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:48,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:48,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:48,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:27:48,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:48,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:48,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:48,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:48,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:48,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:48,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:48,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:48,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:27:48,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,020 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-07-29 01:27:48,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:48,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:27:48,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 01:27:48,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 17 transitions. [2020-07-29 01:27:48,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:27:48,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:27:48,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:27:48,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:48,025 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:27:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:27:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:27:48,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:48,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:27:48,027 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:27:48,027 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:27:48,027 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:48,029 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:27:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:27:48,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:48,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:48,029 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 17 transitions. [2020-07-29 01:27:48,029 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 17 transitions. [2020-07-29 01:27:48,030 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:48,031 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:27:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:27:48,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:48,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:48,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:48,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:27:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:27:48,033 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:27:48,033 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:27:48,033 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:27:48,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:27:48,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:27:48,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:48,035 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 297#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 301#L23 assume !(main_~q~0 < main_~p~0); 303#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 295#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 302#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 293#L26-2 [2020-07-29 01:27:48,035 INFO L796 eck$LassoCheckResult]: Loop: 293#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 298#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 293#L26-2 [2020-07-29 01:27:48,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 1 times [2020-07-29 01:27:48,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328410434] [2020-07-29 01:27:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,052 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-07-29 01:27:48,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810784250] [2020-07-29 01:27:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash 666829459, now seen corresponding path program 2 times [2020-07-29 01:27:48,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803726369] [2020-07-29 01:27:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,116 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:48,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:48,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:48,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:48,116 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:48,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:48,117 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:48,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration4_Loop [2020-07-29 01:27:48,117 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:48,117 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:48,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,229 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:48,229 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:27:48,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:48,234 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:48,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:48,304 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:48,305 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:48,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:48,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:48,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:48,306 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:48,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,306 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:48,306 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:48,306 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration4_Loop [2020-07-29 01:27:48,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:48,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:48,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,422 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:48,423 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:48,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:48,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:48,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:48,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:48,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:48,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:48,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:48,446 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:48,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:48,451 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:48,458 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:48,458 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:48,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2020-07-29 01:27:48,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:48,496 INFO L393 LassoCheck]: Loop: "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:27:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:48,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:48,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:48,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {370#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {370#unseeded} is VALID [2020-07-29 01:27:48,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {370#unseeded} is VALID [2020-07-29 01:27:48,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !(main_~q~0 < main_~p~0); {370#unseeded} is VALID [2020-07-29 01:27:48,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {370#unseeded} is VALID [2020-07-29 01:27:48,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {370#unseeded} is VALID [2020-07-29 01:27:48,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {370#unseeded} is VALID [2020-07-29 01:27:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:48,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:48,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:48,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {403#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} is VALID [2020-07-29 01:27:48,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {383#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:48,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:48,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:48,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:48,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:27:48,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 5 states. [2020-07-29 01:27:48,606 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 01:27:48,606 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:48,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:27:48,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:48,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:48,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-07-29 01:27:48,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,609 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:27:48,609 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:48,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:48,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:48,610 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:48,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:48,611 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:27:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:27:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:27:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:48,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:27:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:48,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:48,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:48,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:48,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:48,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:48,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:48,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,623 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:27:48,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:27:48,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:48,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:27:48,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:48,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:48,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2020-07-29 01:27:48,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:27:48,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:27:48,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-07-29 01:27:48,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:48,630 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:27:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-07-29 01:27:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-29 01:27:48,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:48,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 01:27:48,633 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 01:27:48,633 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 01:27:48,633 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:48,635 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:27:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:27:48,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:48,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:48,636 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states and 30 transitions. [2020-07-29 01:27:48,636 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states and 30 transitions. [2020-07-29 01:27:48,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:48,639 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:27:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:27:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:48,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:48,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:48,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:27:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-07-29 01:27:48,642 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:27:48,642 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:27:48,642 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:27:48,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:27:48,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:48,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:48,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:48,644 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2020-07-29 01:27:48,644 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:48,644 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 445#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 448#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 449#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 452#L23 assume !(main_~q~0 < main_~p~0); 441#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 442#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 455#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 456#L26-2 [2020-07-29 01:27:48,644 INFO L796 eck$LassoCheckResult]: Loop: 456#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 457#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 456#L26-2 [2020-07-29 01:27:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash 602336749, now seen corresponding path program 3 times [2020-07-29 01:27:48,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621817221] [2020-07-29 01:27:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2020-07-29 01:27:48,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112195743] [2020-07-29 01:27:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash -974968848, now seen corresponding path program 4 times [2020-07-29 01:27:48,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:48,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332012158] [2020-07-29 01:27:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:48,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:48,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:48,743 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:48,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:48,744 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:48,744 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:48,744 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:48,744 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:48,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:48,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration5_Loop [2020-07-29 01:27:48,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:48,745 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:48,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:48,891 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 01:27:48,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:48,898 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 01:27:48,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:48,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:48,966 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:48,968 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:48,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:48,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:48,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:48,969 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:48,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:48,969 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:48,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:48,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration5_Loop [2020-07-29 01:27:48,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:48,969 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:48,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:48,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,092 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:49,092 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 01:27:49,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:49,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:49,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:49,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:49,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:49,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:49,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:49,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:49,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:49,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:49,109 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 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 01:27:49,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:49,123 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:49,124 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:49,124 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2020-07-29 01:27:49,147 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:49,149 INFO L393 LassoCheck]: Loop: "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:27:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {564#unseeded} is VALID [2020-07-29 01:27:49,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#unseeded} assume !(main_~q~0 < main_~p~0); {564#unseeded} is VALID [2020-07-29 01:27:49,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {564#unseeded} is VALID [2020-07-29 01:27:49,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {567#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {603#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} is VALID [2020-07-29 01:27:49,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {603#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {577#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:49,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:49,234 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 01:27:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:49,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 01:27:49,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2020-07-29 01:27:49,264 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 01:27:49,264 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:49,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2020-07-29 01:27:49,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:49,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:49,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:49,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:49,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:49,269 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:49,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,279 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:27:49,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,280 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {564#unseeded} is VALID [2020-07-29 01:27:49,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#unseeded} assume !(main_~q~0 < main_~p~0); {564#unseeded} is VALID [2020-07-29 01:27:49,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {564#unseeded} is VALID [2020-07-29 01:27:49,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {567#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {668#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} is VALID [2020-07-29 01:27:49,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {577#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:49,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:49,342 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 01:27:49,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:49,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 01:27:49,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2020-07-29 01:27:49,366 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 01:27:49,366 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:49,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2020-07-29 01:27:49,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:49,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,369 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,369 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:49,369 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:49,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,370 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:49,370 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:49,371 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:49,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:27:49,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,380 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:27:49,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,381 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {564#unseeded} is VALID [2020-07-29 01:27:49,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#unseeded} assume !(main_~q~0 < main_~p~0); {564#unseeded} is VALID [2020-07-29 01:27:49,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {564#unseeded} is VALID [2020-07-29 01:27:49,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {564#unseeded} is VALID [2020-07-29 01:27:49,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {564#unseeded} is VALID [2020-07-29 01:27:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:49,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:49,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {567#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {733#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} is VALID [2020-07-29 01:27:49,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#(and (< 0 ULTIMATE.start_main_~q~0) (<= ULTIMATE.start_main_~q~0 oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {577#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:49,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:49,456 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 01:27:49,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,456 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:49,456 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 01:27:49,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 33 states and 45 transitions. Complement of second has 4 states. [2020-07-29 01:27:49,488 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 01:27:49,488 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:49,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2020-07-29 01:27:49,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:27:49,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 01:27:49,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:49,493 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:49,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:27:49,493 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:49,494 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 45 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:49,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:49,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:27:49,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:27:49,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:27:49,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:27:49,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:49,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:27:49,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:49,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:49,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:49,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:49,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:49,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:49,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:49,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 45 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:27:49,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,513 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:27:49,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:27:49,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:27:49,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:27:49,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:49,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:49,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:27:49,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 36 transitions. [2020-07-29 01:27:49,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:27:49,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:27:49,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-07-29 01:27:49,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:49,520 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:27:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-07-29 01:27:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2020-07-29 01:27:49,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:49,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 36 transitions. Second operand 16 states. [2020-07-29 01:27:49,522 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 36 transitions. Second operand 16 states. [2020-07-29 01:27:49,522 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 16 states. [2020-07-29 01:27:49,522 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:49,524 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-29 01:27:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-29 01:27:49,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:49,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:49,525 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 27 states and 36 transitions. [2020-07-29 01:27:49,525 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 27 states and 36 transitions. [2020-07-29 01:27:49,526 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:49,528 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-29 01:27:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-29 01:27:49,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:49,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:49,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:49,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:27:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:27:49,530 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:27:49,530 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:27:49,530 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:27:49,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:27:49,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:27:49,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:49,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:49,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:27:49,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2020-07-29 01:27:49,532 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 781#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 789#L23 assume !(main_~q~0 < main_~p~0); 788#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 779#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 786#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 787#L26-2 [2020-07-29 01:27:49,532 INFO L796 eck$LassoCheckResult]: Loop: 787#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 782#L23 assume !(main_~q~0 < main_~p~0); 776#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 777#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 785#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 787#L26-2 [2020-07-29 01:27:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 5 times [2020-07-29 01:27:49,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:49,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961031028] [2020-07-29 01:27:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,547 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 38328847, now seen corresponding path program 1 times [2020-07-29 01:27:49,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:49,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555139564] [2020-07-29 01:27:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1292746272, now seen corresponding path program 6 times [2020-07-29 01:27:49,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:49,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241839258] [2020-07-29 01:27:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:49,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:49,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:49,656 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:49,657 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:49,657 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:49,657 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:49,657 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:49,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:49,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:49,658 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:49,658 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration6_Loop [2020-07-29 01:27:49,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:49,658 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:49,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:49,820 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:49,821 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:49,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:49,824 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:49,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:49,869 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,020 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:50,021 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:50,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:50,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:50,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:50,022 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:50,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:50,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:50,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration6_Loop [2020-07-29 01:27:50,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:50,022 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:50,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,200 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:50,200 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:50,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:50,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:50,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:50,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:50,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:50,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:50,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:50,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:50,221 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:50,222 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:50,224 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:50,225 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:50,225 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:50,225 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:50,262 INFO L393 LassoCheck]: Loop: "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume !(main_~q~0 < main_~p~0);" "assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" "assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2;" [2020-07-29 01:27:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:50,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {900#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {900#unseeded} is VALID [2020-07-29 01:27:50,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {900#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {900#unseeded} is VALID [2020-07-29 01:27:50,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {900#unseeded} assume !(main_~q~0 < main_~p~0); {900#unseeded} is VALID [2020-07-29 01:27:50,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {900#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {900#unseeded} is VALID [2020-07-29 01:27:50,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {900#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {900#unseeded} is VALID [2020-07-29 01:27:50,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {900#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {900#unseeded} is VALID [2020-07-29 01:27:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:50,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:50,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {903#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {903#(>= oldRank0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-29 01:27:50,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {903#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume !(main_~q~0 < main_~p~0); {903#(>= oldRank0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-29 01:27:50,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {903#(>= oldRank0 ULTIMATE.start_main_~q~0)} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {939#(<= (+ ULTIMATE.start_main_~p~0 2) oldRank0)} is VALID [2020-07-29 01:27:50,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {939#(<= (+ ULTIMATE.start_main_~p~0 2) oldRank0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {943#(and (< 0 ULTIMATE.start_main_~q~0) (<= (+ ULTIMATE.start_main_~p~0 2) oldRank0))} is VALID [2020-07-29 01:27:50,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {943#(and (< 0 ULTIMATE.start_main_~q~0) (<= (+ ULTIMATE.start_main_~p~0 2) oldRank0))} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {913#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~q~0)) unseeded)} is VALID [2020-07-29 01:27:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:50,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:50,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:50,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,423 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:27:50,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:27:50,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 41 states and 58 transitions. Complement of second has 8 states. [2020-07-29 01:27:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:50,497 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:50,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:27:50,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:50,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:50,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:50,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:27:50,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:50,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:50,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2020-07-29 01:27:50,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:50,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:50,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:50,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:27:50,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:50,502 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:27:50,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:50,503 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 58 transitions. cyclomatic complexity: 25 [2020-07-29 01:27:50,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:50,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:27:50,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:27:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:27:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:50,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:50,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:50,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:50,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:50,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:27:50,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:27:50,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:27:50,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:27:50,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:50,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:50,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:50,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:50,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:50,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,558 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:27:50,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:27:50,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:27:50,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:27:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:50,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. cyclomatic complexity: 25 [2020-07-29 01:27:50,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:50,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 48 transitions. [2020-07-29 01:27:50,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:27:50,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:27:50,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2020-07-29 01:27:50,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:50,577 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-07-29 01:27:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2020-07-29 01:27:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2020-07-29 01:27:50,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:50,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 48 transitions. Second operand 23 states. [2020-07-29 01:27:50,582 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 48 transitions. Second operand 23 states. [2020-07-29 01:27:50,582 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 23 states. [2020-07-29 01:27:50,582 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:50,589 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-07-29 01:27:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-07-29 01:27:50,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:50,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:50,590 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 34 states and 48 transitions. [2020-07-29 01:27:50,590 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 34 states and 48 transitions. [2020-07-29 01:27:50,590 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:50,596 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-29 01:27:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-07-29 01:27:50,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:50,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:50,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:50,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:27:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-07-29 01:27:50,603 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-29 01:27:50,603 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-29 01:27:50,603 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:27:50,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:27:50,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:50,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:50,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:50,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2020-07-29 01:27:50,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:50,615 INFO L794 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 1005#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 1016#L23 assume !(main_~q~0 < main_~p~0); 1000#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 1001#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 1013#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 1014#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 1010#L23 [2020-07-29 01:27:50,615 INFO L796 eck$LassoCheckResult]: Loop: 1010#L23 assume !(main_~q~0 < main_~p~0); 1012#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 1009#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 1010#L23 [2020-07-29 01:27:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1363962694, now seen corresponding path program 7 times [2020-07-29 01:27:50,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:50,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911333153] [2020-07-29 01:27:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:50,657 INFO L82 PathProgramCache]: Analyzing trace with hash 44774, now seen corresponding path program 2 times [2020-07-29 01:27:50,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:50,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273174339] [2020-07-29 01:27:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 872985485, now seen corresponding path program 8 times [2020-07-29 01:27:50,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:50,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591536627] [2020-07-29 01:27:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:50,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:50,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:50,721 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:50,721 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:50,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:50,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:50,722 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:50,722 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,722 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:50,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:50,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration7_Loop [2020-07-29 01:27:50,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:50,723 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:50,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:50,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:50,944 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:50,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:50,947 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,951 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:50,951 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:50,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:50,987 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:50,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:50,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:51,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:51,024 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:51,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:51,260 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:51,263 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:51,263 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:51,263 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:51,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:51,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:51,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:51,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:51,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration7_Loop [2020-07-29 01:27:51,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:51,264 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:51,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:51,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:51,447 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:51,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:51,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:51,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:51,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:51,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:51,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:51,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:51,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:51,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:51,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:51,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:51,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:51,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:51,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:51,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:51,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:51,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:51,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:51,543 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:27:51,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:51,545 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:27:51,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:51,559 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:27:51,559 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:51,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:51,562 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:51,562 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:51,562 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2020-07-29 01:27:51,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:51,590 INFO L393 LassoCheck]: Loop: "assume !(main_~q~0 < main_~p~0);" "assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3;" "assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0);" [2020-07-29 01:27:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {1152#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {1152#unseeded} is VALID [2020-07-29 01:27:51,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {1152#unseeded} assume !(main_~q~0 < main_~p~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {1152#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1152#unseeded} is VALID [2020-07-29 01:27:51,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,621 INFO L280 TraceCheckUtils]: 5: Hoare triple {1152#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {1152#unseeded} is VALID [2020-07-29 01:27:51,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume !(main_~q~0 < main_~p~0); {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} is VALID [2020-07-29 01:27:51,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1191#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} is VALID [2020-07-29 01:27:51,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {1191#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1165#(or (and (> oldRank0 ULTIMATE.start_main_~p~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:51,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:51,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:51,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:51,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:27:51,721 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2020-07-29 01:27:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:51,722 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:51,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:51,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-07-29 01:27:51,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:51,725 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:51,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:51,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:51,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 40 transitions. cyclomatic complexity: 18 [2020-07-29 01:27:51,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:51,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,737 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-07-29 01:27:51,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,737 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {1152#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {1152#unseeded} is VALID [2020-07-29 01:27:51,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {1152#unseeded} assume !(main_~q~0 < main_~p~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,781 INFO L280 TraceCheckUtils]: 3: Hoare triple {1152#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1152#unseeded} is VALID [2020-07-29 01:27:51,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {1152#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {1152#unseeded} is VALID [2020-07-29 01:27:51,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume !(main_~q~0 < main_~p~0); {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} is VALID [2020-07-29 01:27:51,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1257#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} is VALID [2020-07-29 01:27:51,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1165#(or (and (> oldRank0 ULTIMATE.start_main_~p~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:51,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:51,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:51,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:51,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:27:51,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2020-07-29 01:27:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:51,869 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:51,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:51,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-07-29 01:27:51,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:51,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:51,871 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:51,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:51,872 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:51,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:51,872 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:51,872 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 40 transitions. cyclomatic complexity: 18 [2020-07-29 01:27:51,873 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:51,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,886 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-07-29 01:27:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,887 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {1152#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; {1152#unseeded} is VALID [2020-07-29 01:27:51,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {1152#unseeded} assume !(main_~q~0 < main_~p~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {1152#unseeded} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1152#unseeded} is VALID [2020-07-29 01:27:51,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {1152#unseeded} assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; {1152#unseeded} is VALID [2020-07-29 01:27:51,943 INFO L280 TraceCheckUtils]: 6: Hoare triple {1152#unseeded} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1152#unseeded} is VALID [2020-07-29 01:27:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:51,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:51,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume !(main_~q~0 < main_~p~0); {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} is VALID [2020-07-29 01:27:51,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {1155#(>= oldRank0 ULTIMATE.start_main_~p~0)} assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; {1323#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} is VALID [2020-07-29 01:27:51,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {1323#(<= (+ ULTIMATE.start_main_~p~0 1) oldRank0)} assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); {1165#(or (and (> oldRank0 ULTIMATE.start_main_~p~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:51,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:51,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:51,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:51,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:51,995 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:51,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:27:52,028 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 36 states and 57 transitions. Complement of second has 6 states. [2020-07-29 01:27:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:52,029 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:52,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:52,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:52,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:52,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:52,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:52,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:52,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:52,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. [2020-07-29 01:27:52,031 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:52,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:52,031 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:27:52,031 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:52,031 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:52,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:52,032 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:52,032 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 57 transitions. cyclomatic complexity: 27 [2020-07-29 01:27:52,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. cyclomatic complexity: 27 [2020-07-29 01:27:52,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:52,032 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:27:52,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:52,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,039 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:27:52,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:52,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:52,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:27:52,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:52,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. cyclomatic complexity: 27 [2020-07-29 01:27:52,042 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:52,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2020-07-29 01:27:52,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:27:52,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:27:52,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:27:52,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:52,042 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:52,043 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:52,043 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:52,043 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:27:52,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:27:52,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:52,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:52,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:52 BoogieIcfgContainer [2020-07-29 01:27:52,050 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:52,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:52,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:52,051 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:52,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:45" (3/4) ... [2020-07-29 01:27:52,055 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:27:52,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:52,059 INFO L168 Benchmark]: Toolchain (without parser) took 7688.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 178.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:52,059 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:52,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.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 01:27:52,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:52,061 INFO L168 Benchmark]: Boogie Preprocessor took 81.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:52,062 INFO L168 Benchmark]: RCFGBuilder took 264.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:52,063 INFO L168 Benchmark]: BuchiAutomizer took 7037.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:52,063 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:52,066 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 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 250.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.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 39.62 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7037.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function q and consists of 5 locations. One deterministic module has affine ranking function p and consists of 4 locations. One deterministic module has affine ranking function q and consists of 3 locations. One deterministic module has affine ranking function q and consists of 5 locations. One nondeterministic module has affine ranking function q and consists of 3 locations. One nondeterministic module has affine ranking function p and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 49 SDtfs, 75 SDslu, 9 SDs, 0 SdLazy, 113 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax161 hnf99 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp93 dnf112 smp98 tf106 neg98 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...