./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/PastaC3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-restricted-15/PastaC3.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 c651b2cf12ef151f8c483095acc3023b343707b6f3267a95c45195266139a503 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:26:59,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:26:59,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:26:59,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:26:59,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:26:59,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:26:59,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:26:59,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:26:59,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:26:59,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:26:59,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:26:59,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:26:59,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:26:59,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:26:59,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:26:59,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:26:59,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:26:59,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:26:59,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:26:59,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:26:59,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:26:59,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:26:59,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:26:59,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:26:59,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:26:59,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:26:59,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:26:59,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:26:59,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:26:59,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:26:59,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:26:59,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:26:59,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:26:59,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:26:59,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:26:59,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:26:59,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:26:59,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:26:59,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:26:59,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:26:59,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:26:59,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:26:59,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:26:59,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:26:59,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:26:59,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:26:59,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:26:59,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:26:59,770 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:26:59,770 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:26:59,770 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:26:59,770 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:26:59,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:26:59,771 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:26:59,771 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:26:59,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:26:59,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:26:59,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:26:59,773 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:26:59,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:26:59,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:26:59,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:26:59,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:26:59,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:26:59,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:26:59,775 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:26:59,775 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c651b2cf12ef151f8c483095acc3023b343707b6f3267a95c45195266139a503 [2022-02-21 03:26:59,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:27:00,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:27:00,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:27:00,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:27:00,038 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:27:00,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/PastaC3.c [2022-02-21 03:27:00,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374fb4215/592e214a508442e387acc120f767d558/FLAG0c38c534c [2022-02-21 03:27:00,471 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:27:00,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/PastaC3.c [2022-02-21 03:27:00,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374fb4215/592e214a508442e387acc120f767d558/FLAG0c38c534c [2022-02-21 03:27:00,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374fb4215/592e214a508442e387acc120f767d558 [2022-02-21 03:27:00,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:27:00,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:27:00,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:27:00,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:27:00,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:27:00,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:27:00" (1/1) ... [2022-02-21 03:27:00,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a49e040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:00, skipping insertion in model container [2022-02-21 03:27:00,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:27:00" (1/1) ... [2022-02-21 03:27:00,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:27:00,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:27:01,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:27:01,104 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:27:01,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:27:01,124 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:27:01,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01 WrapperNode [2022-02-21 03:27:01,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:27:01,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:27:01,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:27:01,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:27:01,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,155 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:27:01,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:27:01,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:27:01,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:27:01,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:27:01,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:27:01,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:27:01,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:27:01,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:27:01,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (1/1) ... [2022-02-21 03:27:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:01,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:01,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:01,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:27:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:27:01,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:27:01,325 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:27:01,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:27:01,389 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:27:01,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:27:01,394 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:27:01,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:01 BoogieIcfgContainer [2022-02-21 03:27:01,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:27:01,396 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:27:01,396 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:27:01,399 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:27:01,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:01,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:27:00" (1/3) ... [2022-02-21 03:27:01,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65143619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:27:01, skipping insertion in model container [2022-02-21 03:27:01,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:01,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:27:01" (2/3) ... [2022-02-21 03:27:01,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65143619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:27:01, skipping insertion in model container [2022-02-21 03:27:01,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:27:01,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:01" (3/3) ... [2022-02-21 03:27:01,401 INFO L388 chiAutomizerObserver]: Analyzing ICFG PastaC3.c [2022-02-21 03:27:01,430 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:27:01,431 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:27:01,431 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:27:01,431 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:27:01,431 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:27:01,431 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:27:01,431 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:27:01,431 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:27:01,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:01,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:01,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:01,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:01,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:27:01,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:27:01,462 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:27:01,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:01,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:01,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:01,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:01,465 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:27:01,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:27:01,471 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9#L14-2true [2022-02-21 03:27:01,471 INFO L793 eck$LassoCheckResult]: Loop: 9#L14-2true assume !!(main_~x~0#1 < main_~y~0#1); 8#L14true assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; 9#L14-2true [2022-02-21 03:27:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:27:01,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:01,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533272004] [2022-02-21 03:27:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,605 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:27:01,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:01,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416559990] [2022-02-21 03:27:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,646 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:27:01,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:01,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9815406] [2022-02-21 03:27:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:01,681 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:01,764 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:01,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:01,765 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:01,765 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:01,766 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:01,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:01,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:01,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:01,775 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration1_Loop [2022-02-21 03:27:01,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:01,775 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:01,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:01,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:01,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:01,928 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:01,929 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:01,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:01,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:27:01,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:01,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:01,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:01,990 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: [] [2022-02-21 03:27:02,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:02,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:27:02,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:02,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:02,046 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:02,046 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: [] [2022-02-21 03:27:02,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:27:02,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:27:02,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:02,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:02,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:27:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:27:02,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:02,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:02,350 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:02,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:02,357 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:02,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:02,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:02,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:02,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:02,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:02,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:02,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration1_Loop [2022-02-21 03:27:02,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:02,358 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:02,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:02,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:27:02,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:02,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:02,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:02,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:02,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:02,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:02,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:02,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:02,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:02,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:02,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:02,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:02,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:02,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:02,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:02,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:27:02,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:02,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:02,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:02,567 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:02,567 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:27:02,571 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:02,571 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:02,572 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:02,577 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~z~0#1) = 2*ULTIMATE.start_main_~x~0#1 - 2*ULTIMATE.start_main_~z~0#1 + 1 Supporting invariants [] [2022-02-21 03:27:02,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:02,613 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:02,617 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < main_~y~0#1);" "assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1;" [2022-02-21 03:27:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:02,648 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:02,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:02,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#unseeded} assume { :begin_inline_ULTIMATE.init } true; {18#unseeded} is VALID [2022-02-21 03:27:02,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {18#unseeded} is VALID [2022-02-21 03:27:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:02,669 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:02,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:02,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_~x~0#1 < main_~y~0#1); {21#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-21 03:27:02,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; {31#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:27:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:02,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:02,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:27:02,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,774 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 6 states. [2022-02-21 03:27:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:27:02,774 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:02,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:02,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:02,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:02,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:27:02,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:02,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:02,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:27:02,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:02,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:02,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:02,785 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:02,786 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:02,786 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:27:02,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:02,787 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:27:02,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:02,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:27:02,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:27:02,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:27:02,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:02,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:02,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:02,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:02,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:02,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:02,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:02,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:02,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:02,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:02,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:02,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:27:02,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,800 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:27:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:02,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:27:02,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:02,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:27:02,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:27:02,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:27:02,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:27:02,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:02,809 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:27:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:27:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:27:02,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:02,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,825 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,826 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,828 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:02,829 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:27:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:27:02,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:02,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:02,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:27:02,830 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:27:02,830 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:02,831 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:27:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:27:02,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:02,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:02,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:02,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:27:02,833 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:27:02,833 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:27:02,833 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:27:02,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:27:02,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:02,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:02,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:02,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:27:02,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:27:02,834 INFO L791 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 75#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 76#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 77#L14 assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; 78#L14-2 [2022-02-21 03:27:02,835 INFO L793 eck$LassoCheckResult]: Loop: 78#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 81#L14 assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; 78#L14-2 [2022-02-21 03:27:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-02-21 03:27:02,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:02,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21268031] [2022-02-21 03:27:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,844 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-02-21 03:27:02,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:02,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960240731] [2022-02-21 03:27:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,854 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-02-21 03:27:02,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:02,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689319942] [2022-02-21 03:27:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:02,869 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:02,888 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:02,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:02,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:02,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:02,889 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:02,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:02,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:02,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration2_Loop [2022-02-21 03:27:02,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:02,890 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:02,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:02,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:02,950 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:02,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:02,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:02,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:02,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:27:02,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:02,983 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: [] [2022-02-21 03:27:03,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:03,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:03,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:03,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:27:03,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:03,072 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:03,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:03,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,092 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:03,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:03,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:27:03,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:03,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:27:03,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:03,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:03,343 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:03,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:27:03,347 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:03,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:03,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:03,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:03,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:03,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:03,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:03,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration2_Loop [2022-02-21 03:27:03,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:03,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:03,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,409 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:03,409 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,416 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:27:03,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:03,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:03,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:03,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:03,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:03,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:03,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:03,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:03,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:03,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:27:03,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:03,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:03,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:03,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:03,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:03,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:03,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:03,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:03,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:27:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:27:03,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:03,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:03,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:03,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:03,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:03,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:03,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:03,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:03,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:03,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:03,605 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:03,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,612 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:27:03,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:03,656 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:03,656 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:03,656 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~z~0#1) = 2*ULTIMATE.start_main_~x~0#1 - 2*ULTIMATE.start_main_~z~0#1 + 1 Supporting invariants [] [2022-02-21 03:27:03,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:27:03,684 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:03,690 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < main_~y~0#1);" "assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1;" [2022-02-21 03:27:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:03,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:03,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:03,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#unseeded} assume { :begin_inline_ULTIMATE.init } true; {131#unseeded} is VALID [2022-02-21 03:27:03,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {131#unseeded} is VALID [2022-02-21 03:27:03,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {131#unseeded} is VALID [2022-02-21 03:27:03,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {131#unseeded} is VALID [2022-02-21 03:27:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:03,728 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:03,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:03,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_~x~0#1 < main_~y~0#1); {134#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-21 03:27:03,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; {144#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:27:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:03,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:03,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:27:03,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:27:03,777 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 [2022-02-21 03:27:03,777 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:03,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:27:03,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:03,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:03,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:03,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:03,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:03,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:03,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:03,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:03,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:27:03,780 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:03,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:03,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:03,781 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:03,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:03,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:03,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:03,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:03,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:03,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:03,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:27:03,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:03,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:03,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:03,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:03,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:03,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:27:03,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:03,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:03,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:03,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,793 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:27:03,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:03,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:03,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:27:03,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:03,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:03,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:03,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:27:03,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:27:03,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:27:03,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:03,800 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:27:03,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:27:03,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:03,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,801 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,801 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,801 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:03,802 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:27:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:03,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:03,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:27:03,803 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:27:03,803 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:03,804 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:27:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:03,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:03,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:03,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:27:03,805 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:27:03,805 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:27:03,805 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:27:03,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:27:03,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:03,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:03,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:03,806 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2022-02-21 03:27:03,806 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:27:03,806 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 182#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 183#L14 assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; 184#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 189#L14 assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; 187#L14-2 [2022-02-21 03:27:03,806 INFO L793 eck$LassoCheckResult]: Loop: 187#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 188#L14 assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; 187#L14-2 [2022-02-21 03:27:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 889692233, now seen corresponding path program 2 times [2022-02-21 03:27:03,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:03,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078223558] [2022-02-21 03:27:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,816 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2022-02-21 03:27:03,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:03,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733643255] [2022-02-21 03:27:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,822 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 295744366, now seen corresponding path program 2 times [2022-02-21 03:27:03,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:03,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337107208] [2022-02-21 03:27:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:03,838 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:03,853 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:03,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:03,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:03,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:03,853 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:03,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:03,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:03,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration3_Loop [2022-02-21 03:27:03,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:03,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:03,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:03,894 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:03,894 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:03,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,899 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:27:03,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:03,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:03,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:27:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:03,939 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:03,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:27:03,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:03,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:04,117 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:04,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:04,121 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:04,121 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:04,121 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:04,121 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:04,121 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:04,121 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,121 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:04,122 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:04,122 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration3_Loop [2022-02-21 03:27:04,122 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:04,122 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:04,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:04,189 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,196 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:27:04,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:04,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:04,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:04,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:04,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:04,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:04,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:04,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:04,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:04,217 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:04,217 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:04,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,219 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:27:04,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:04,222 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:04,222 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:04,222 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~z~0#1) = 2*ULTIMATE.start_main_~x~0#1 - 2*ULTIMATE.start_main_~z~0#1 + 1 Supporting invariants [] [2022-02-21 03:27:04,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:27:04,247 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:04,251 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < main_~y~0#1);" "assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1;" [2022-02-21 03:27:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#unseeded} assume { :begin_inline_ULTIMATE.init } true; {255#unseeded} is VALID [2022-02-21 03:27:04,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {255#unseeded} is VALID [2022-02-21 03:27:04,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,318 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_~x~0#1 < main_~y~0#1); {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-21 03:27:04,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; {268#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:27:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:04,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:04,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:27:04,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:27:04,405 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 21 transitions. Complement of second has 5 states. [2022-02-21 03:27:04,405 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 [2022-02-21 03:27:04,405 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-02-21 03:27:04,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,406 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:04,407 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:04,407 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:27:04,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,415 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:27:04,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,416 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:27:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#unseeded} assume { :begin_inline_ULTIMATE.init } true; {255#unseeded} is VALID [2022-02-21 03:27:04,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {255#unseeded} is VALID [2022-02-21 03:27:04,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,463 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_~x~0#1 < main_~y~0#1); {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-21 03:27:04,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; {268#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:27:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:04,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,477 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:27:04,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 21 transitions. Complement of second has 5 states. [2022-02-21 03:27:04,497 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 [2022-02-21 03:27:04,497 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-02-21 03:27:04,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,499 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:04,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:04,500 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:27:04,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:04,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:27:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,508 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:27:04,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,509 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:27:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#unseeded} assume { :begin_inline_ULTIMATE.init } true; {255#unseeded} is VALID [2022-02-21 03:27:04,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {255#unseeded} is VALID [2022-02-21 03:27:04,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#unseeded} assume !!(main_~x~0#1 < main_~y~0#1); {255#unseeded} is VALID [2022-02-21 03:27:04,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {255#unseeded} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {255#unseeded} is VALID [2022-02-21 03:27:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,546 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:04,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:04,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(main_~x~0#1 < main_~y~0#1); {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-21 03:27:04,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~x~0#1 < main_~z~0#1);main_~z~0#1 := 1 + main_~z~0#1; {268#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) (* (- 2) |ULTIMATE.start_main_~z~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:27:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:04,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:04,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,579 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:27:04,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 24 transitions. Complement of second has 4 states. [2022-02-21 03:27:04,601 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 [2022-02-21 03:27:04,601 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2022-02-21 03:27:04,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:04,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,602 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:04,602 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:04,602 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:04,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:04,603 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 03:27:04,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:27:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,607 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:27:04,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:27:04,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:27:04,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:27:04,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:04,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 03:27:04,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:04,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2022-02-21 03:27:04,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:27:04,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:27:04,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-02-21 03:27:04,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:27:04,609 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:27:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-02-21 03:27:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2022-02-21 03:27:04,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:27:04,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,610 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,610 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,610 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:04,611 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:27:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:27:04,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:04,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:04,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:27:04,611 INFO L87 Difference]: Start difference. First operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:27:04,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:27:04,612 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:27:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:27:04,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:27:04,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:27:04,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:27:04,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:27:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-02-21 03:27:04,613 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2022-02-21 03:27:04,613 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2022-02-21 03:27:04,613 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:27:04,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2022-02-21 03:27:04,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:27:04,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:04,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:04,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:27:04,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:27:04,613 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 401#L14-2 [2022-02-21 03:27:04,613 INFO L793 eck$LassoCheckResult]: Loop: 401#L14-2 assume !!(main_~x~0#1 < main_~y~0#1); 402#L14 assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; 401#L14-2 [2022-02-21 03:27:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:27:04,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:04,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841855499] [2022-02-21 03:27:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,629 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1316, now seen corresponding path program 1 times [2022-02-21 03:27:04,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:04,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664487447] [2022-02-21 03:27:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,648 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 3 times [2022-02-21 03:27:04,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:27:04,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491364186] [2022-02-21 03:27:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:27:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:27:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:27:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:27:04,654 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:27:04,682 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:04,682 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:04,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:04,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:04,682 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:27:04,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:04,682 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:04,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration4_Loop [2022-02-21 03:27:04,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:04,683 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:04,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:04,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:04,739 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:27:04,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,741 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:27:04,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:04,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:04,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:04,785 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:04,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,804 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:27:04,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:04,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:04,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:27:04,818 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:27:04,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:27:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,841 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:27:04,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:27:04,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:04,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:04,878 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:04,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:27:04,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:27:04,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:27:04,998 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:27:05,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:27:05,002 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:27:05,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:27:05,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:27:05,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:27:05,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:27:05,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:27:05,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:27:05,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: PastaC3.c_Iteration4_Loop [2022-02-21 03:27:05,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:27:05,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:27:05,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:27:05,051 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:27:05,051 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:27:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,052 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:27:05,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:05,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:05,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:05,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:05,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:05,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:27:05,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:27:05,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:27:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:27:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,094 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:27:05,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:27:05,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:27:05,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:27:05,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:27:05,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:27:05,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:27:05,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:27:05,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:27:05,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:27:05,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:27:05,107 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:27:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:27:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:27:05,108 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:27:05,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:27:05,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:27:05,110 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:27:05,110 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:27:05,110 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~y~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:27:05,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:27:05,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:27:05,136 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < main_~y~0#1);" "assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1;" [2022-02-21 03:27:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:27:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:05,156 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:27:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:05,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:05,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#unseeded} assume { :begin_inline_ULTIMATE.init } true; {468#unseeded} is VALID [2022-02-21 03:27:05,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {468#unseeded} is VALID [2022-02-21 03:27:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:05,164 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:27:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:27:05,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:27:05,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < main_~y~0#1); {489#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:27:05,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume main_~x~0#1 < main_~z~0#1;main_~x~0#1 := 1 + main_~x~0#1; {481#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:27:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:27:05,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:27:05,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,194 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 [2022-02-21 03:27:05,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 18 transitions. Complement of second has 4 states. [2022-02-21 03:27:05,230 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 [2022-02-21 03:27:05,230 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:05,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:27:05,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:05,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:05,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:05,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:27:05,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:27:05,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2022-02-21 03:27:05,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:27:05,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:27:05,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:27:05,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:27:05,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:27:05,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:27:05,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:05,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:05,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:27:05,233 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:27:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:05,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:27:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,236 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:27:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:27:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:27:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:27:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:27:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:27:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:27:05,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:27:05,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:27:05,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:27:05,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:27:05,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:27:05,248 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:27:05,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:27:05,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:27:05,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:27:05,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:27:05 BoogieIcfgContainer [2022-02-21 03:27:05,253 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:27:05,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:27:05,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:27:05,254 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:27:05,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:27:01" (3/4) ... [2022-02-21 03:27:05,256 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:27:05,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:27:05,257 INFO L158 Benchmark]: Toolchain (without parser) took 4343.16ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 76.8MB in the beginning and 100.3MB in the end (delta: -23.5MB). Peak memory consumption was 719.7kB. Max. memory is 16.1GB. [2022-02-21 03:27:05,257 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:05,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.51ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 84.4MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:27:05,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.59ms. Allocated memory is still 107.0MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:05,258 INFO L158 Benchmark]: Boogie Preprocessor took 14.12ms. Allocated memory is still 107.0MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 916.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:27:05,258 INFO L158 Benchmark]: RCFGBuilder took 224.39ms. Allocated memory is still 107.0MB. Free memory was 82.3MB in the beginning and 73.9MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:27:05,258 INFO L158 Benchmark]: BuchiAutomizer took 3857.04ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 73.9MB in the beginning and 101.3MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:05,259 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:27:05,260 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-02-21 03:27:05,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 --- 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.21ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.51ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 84.4MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.59ms. Allocated memory is still 107.0MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.12ms. Allocated memory is still 107.0MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 916.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.39ms. Allocated memory is still 107.0MB. Free memory was 82.3MB in the beginning and 73.9MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 3857.04ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 73.9MB in the beginning and 101.3MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 100.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 3 locations. One deterministic module has affine ranking function y + -1 * x and consists of 3 locations. One nondeterministic module has affine ranking function 2 * x + -2 * z + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 27 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax187 hnf100 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf110 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 69ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:27:05,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE