./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.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-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.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 82f10acf23a705ed9ee52063aab9490fd4596871d88518858bc1e47422aca9cc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:32,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:32,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:32,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:32,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:32,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:32,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:32,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:32,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:32,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:32,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:32,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:32,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:32,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:32,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:32,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:32,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:32,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:32,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:32,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:32,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:32,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:32,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:32,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:32,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:32,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:32,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:32,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:32,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:32,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:32,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:32,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:32,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:32,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:32,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:32,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:32,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:32,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:32,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:32,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:32,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:32,635 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:24:32,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:32,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:32,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:32,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:32,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:32,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:32,666 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:32,666 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:32,666 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:32,666 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:32,667 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:32,667 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:32,667 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:32,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:32,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:32,668 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:32,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:32,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:32,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:32,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:32,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:32,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:32,670 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:32,670 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 -> 82f10acf23a705ed9ee52063aab9490fd4596871d88518858bc1e47422aca9cc [2022-02-21 03:24:32,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:32,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:32,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:32,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:32,919 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:32,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:24:32,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc570ab25/c0e6a30ed39749eca0195e22cf347b49/FLAGe4572aec5 [2022-02-21 03:24:33,272 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:33,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:24:33,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc570ab25/c0e6a30ed39749eca0195e22cf347b49/FLAGe4572aec5 [2022-02-21 03:24:33,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc570ab25/c0e6a30ed39749eca0195e22cf347b49 [2022-02-21 03:24:33,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:33,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:33,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:33,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:33,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:33,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11371acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33, skipping insertion in model container [2022-02-21 03:24:33,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:33,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:33,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:33,860 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:33,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:33,887 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:33,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33 WrapperNode [2022-02-21 03:24:33,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:33,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:33,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:33,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:33,894 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:24:33" (1/1) ... [2022-02-21 03:24:33,897 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:24:33" (1/1) ... [2022-02-21 03:24:33,910 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:24:33,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:33,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:33,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:33,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:33,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:33,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:33,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:33,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:33,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:33,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:33,992 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:24:34,031 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:24:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:34,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:34,091 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:34,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:34,141 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:34,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:34,146 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:24:34,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34 BoogieIcfgContainer [2022-02-21 03:24:34,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:34,148 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:34,148 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:34,150 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:34,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:33" (1/3) ... [2022-02-21 03:24:34,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639487ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:34, skipping insertion in model container [2022-02-21 03:24:34,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (2/3) ... [2022-02-21 03:24:34,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@639487ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:34, skipping insertion in model container [2022-02-21 03:24:34,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34" (3/3) ... [2022-02-21 03:24:34,153 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:24:34,181 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:34,188 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:34,188 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:34,188 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:34,188 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:34,188 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:34,188 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:34,188 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:34,213 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:24:34,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:34,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:34,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:34,246 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:34,246 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:34,246 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:34,247 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:24:34,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:34,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:34,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:34,249 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:34,249 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:34,253 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; 3#L19-2true [2022-02-21 03:24:34,253 INFO L793 eck$LassoCheckResult]: Loop: 3#L19-2true assume !!(main_~i~0#1 > 0); 9#L19true assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3#L19-2true [2022-02-21 03:24:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:34,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244550941] [2022-02-21 03:24:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,371 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:24:34,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625293795] [2022-02-21 03:24:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,406 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:24:34,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606462564] [2022-02-21 03:24:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,428 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,513 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:34,514 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:34,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:34,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:34,514 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:34,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:34,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:34,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration1_Loop [2022-02-21 03:24:34,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:34,515 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:34,526 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:24:34,532 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:24:34,535 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:24:34,543 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:24:34,639 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:34,639 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:34,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,642 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:24:34,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,687 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:24:34,691 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:34,691 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:24:34,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:24:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,709 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:24:34,710 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:24:34,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,744 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:34,744 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:24:34,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,770 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:24:34,772 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:24:34,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:34,794 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=-4, ULTIMATE.start_main_~N~0#1=-4} Honda state: {ULTIMATE.start_main_~j~0#1=-4, ULTIMATE.start_main_~N~0#1=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:34,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:34,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,813 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:24:34,815 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:24:34,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,852 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:24:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,854 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:24:34,856 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:24:34,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:34,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,885 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:34,888 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:24:34,888 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:34,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:34,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:34,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:34,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:34,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:34,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:34,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration1_Loop [2022-02-21 03:24:34,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:34,889 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:34,890 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:24:34,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:24:34,899 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:24:34,902 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:24:34,964 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:34,967 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,974 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:24:34,976 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:24:34,977 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:24:34,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:34,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:34,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:34,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:34,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:34,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:35,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:24:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,035 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:24:35,036 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:24:35,044 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:24:35,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:35,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:35,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:35,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,082 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:24:35,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,100 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:24:35,134 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:24:35,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:35,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:35,150 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:24:35,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,176 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:24:35,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,178 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:24:35,179 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:24:35,180 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:24:35,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:35,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:35,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:35,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:35,205 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:35,205 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:35,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,207 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:24:35,209 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:24:35,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:35,210 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:35,210 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:35,210 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:35,228 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:24:35,235 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:35,239 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);" "assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:24:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:35,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#unseeded} assume { :begin_inline_ULTIMATE.init } true; {18#unseeded} is VALID [2022-02-21 03:24:35,282 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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {18#unseeded} is VALID [2022-02-21 03:24:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,286 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:35,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {39#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:35,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; {31#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:35,333 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:24:35,363 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:24:35,368 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:24:35,369 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:24:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,372 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:24:35,387 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:24:35,426 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 21 states and 29 transitions. Complement of second has 7 states. [2022-02-21 03:24:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:35,427 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:35,427 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:24:35,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:35,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,428 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:24:35,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:35,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:24:35,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:35,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,432 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:24:35,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:35,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:35,434 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:24:35,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:35,435 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:35,435 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 29 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:35,435 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:35,435 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:24:35,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,436 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:24:35,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:35,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,437 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:24:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,437 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:24:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,437 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:24:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,438 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:24:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,439 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 21 letters. Loop has 21 letters. [2022-02-21 03:24:35,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,439 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 21 letters. Loop has 21 letters. [2022-02-21 03:24:35,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:35,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,439 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:24:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,440 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:24:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,440 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 5 letters. [2022-02-21 03:24:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,441 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 5 letters. [2022-02-21 03:24:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,441 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:24:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,442 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:24:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,442 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:24:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,443 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:24:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,443 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:24:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,444 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:24:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,444 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:24:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,444 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:24:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,445 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:24:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,445 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:24:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,446 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:24:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,446 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:24:35,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 29 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:35,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,447 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:35,451 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:24:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 03:24:35,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:35,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:35,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:24:35,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:35,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:35,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 9 states and 12 transitions. [2022-02-21 03:24:35,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:35,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:35,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:24:35,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:35,461 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:24:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:24:35,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:35,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 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:24:35,480 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 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:24:35,481 INFO L87 Difference]: Start difference. First operand 9 states and 12 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:24:35,483 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:35,484 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:35,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:35,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:35,485 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 9 states and 12 transitions. [2022-02-21 03:24:35,485 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 9 states and 12 transitions. [2022-02-21 03:24:35,486 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:35,486 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:24:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:24:35,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:35,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:35,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:35,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:35,487 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:24:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:24:35,488 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:35,488 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:24:35,488 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:35,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:24:35,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:35,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:35,489 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:35,490 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 79#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; 81#L19-2 assume !!(main_~i~0#1 > 0); 75#L19 [2022-02-21 03:24:35,490 INFO L793 eck$LassoCheckResult]: Loop: 75#L19 assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; 74#L19-2 assume !!(main_~i~0#1 > 0); 75#L19 [2022-02-21 03:24:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:24:35,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685390159] [2022-02-21 03:24:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,496 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-02-21 03:24:35,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676749404] [2022-02-21 03:24:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,502 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 28699749, now seen corresponding path program 1 times [2022-02-21 03:24:35,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925815206] [2022-02-21 03:24:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,509 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,532 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:35,532 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:35,532 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:35,532 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:35,532 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:35,532 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,532 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:35,532 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:35,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration2_Loop [2022-02-21 03:24:35,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:35,533 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:35,534 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:24:35,536 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:24:35,538 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:24:35,542 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:24:35,582 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:35,582 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:35,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,587 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:24:35,588 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:24:35,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:35,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:35,648 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:24:35,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,667 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:24:35,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:35,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,687 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:24:35,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:35,692 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:24:35,710 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:24:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,711 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:24:35,713 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:24:35,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:35,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,753 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:24:35,754 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:24:35,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:35,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,782 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:35,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:35,788 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:35,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:35,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:35,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:35,788 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:35,788 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,788 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:35,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:35,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration2_Loop [2022-02-21 03:24:35,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:35,788 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:35,790 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:24:35,793 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:24:35,795 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:24:35,800 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:24:35,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:35,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:35,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,851 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:24:35,861 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:24:35,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:35,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:35,872 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:24:35,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,924 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:24:35,925 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:24:35,927 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:24:35,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:35,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:35,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,996 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:24:35,997 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:24:35,998 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:24:36,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:36,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:36,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:36,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:36,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:36,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:36,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:36,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:36,046 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:24:36,047 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:36,047 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,049 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:24:36,051 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:24:36,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:36,074 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:36,074 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:36,074 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:24:36,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:24:36,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:36,100 INFO L390 LassoCheck]: Loop: "assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 > 0);" [2022-02-21 03:24:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:36,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#unseeded} assume { :begin_inline_ULTIMATE.init } true; {133#unseeded} is VALID [2022-02-21 03:24:36,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {133#unseeded} is VALID [2022-02-21 03:24:36,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#unseeded} assume !!(main_~i~0#1 > 0); {133#unseeded} is VALID [2022-02-21 03:24:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,139 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:36,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; {157#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:36,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} assume !!(main_~i~0#1 > 0); {146#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:36,194 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:24:36,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:36,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,199 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:24:36,199 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,212 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 21 transitions. Complement of second has 5 states. [2022-02-21 03:24:36,212 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:24:36,212 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:36,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:36,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:36,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:24:36,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:36,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:36,215 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:36,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:36,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:36,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:36,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:36,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:36,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 1 letters. [2022-02-21 03:24:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,234 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:24:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:24:36,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:24:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,235 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:24:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,236 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:24:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,237 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:24:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:36,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 1 letters. [2022-02-21 03:24:36,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,239 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:24:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,240 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:24:36,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:36,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,241 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:24:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:36,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:36,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:36,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:36,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:36,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:36,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2022-02-21 03:24:36,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:36,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:24:36,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:24:36,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:36,245 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:24:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:24:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:24:36,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:36,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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:24:36,246 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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:24:36,246 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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:24:36,247 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,247 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:24:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:24:36,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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 16 transitions. [2022-02-21 03:24:36,248 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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 16 transitions. [2022-02-21 03:24:36,249 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,249 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:24:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:24:36,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:36,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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:24:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:24:36,264 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:24:36,264 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:24:36,264 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:36,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:24:36,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:36,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,265 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-02-21 03:24:36,265 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:36,265 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 189#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; 184#L19-2 assume !!(main_~i~0#1 > 0); 185#L19 assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; 194#L19-2 assume !!(main_~i~0#1 > 0); 190#L19 [2022-02-21 03:24:36,265 INFO L793 eck$LassoCheckResult]: Loop: 190#L19 assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; 191#L19-2 assume !!(main_~i~0#1 > 0); 190#L19 [2022-02-21 03:24:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 28699811, now seen corresponding path program 2 times [2022-02-21 03:24:36,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71111303] [2022-02-21 03:24:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,285 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2022-02-21 03:24:36,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213324043] [2022-02-21 03:24:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,291 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1810715040, now seen corresponding path program 1 times [2022-02-21 03:24:36,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238983865] [2022-02-21 03:24:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,316 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,345 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,346 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:36,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration3_Loop [2022-02-21 03:24:36,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,347 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:24:36,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:24:36,351 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:24:36,355 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:24:36,407 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,407 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,424 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:24:36,440 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:24:36,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,470 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,470 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:36,493 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:24:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,494 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:24:36,495 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:24:36,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,536 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,536 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=1} Honda state: {ULTIMATE.start_main_~i~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:36,567 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:24:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,569 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:24:36,570 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:24:36,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,646 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:24:36,647 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:24:36,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:36,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,683 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:36,687 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:24:36,687 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,687 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:36,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-cousot9.c_Iteration3_Loop [2022-02-21 03:24:36,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,688 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:24:36,702 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:24:36,705 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:24:36,710 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:24:36,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,772 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:24:36,773 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:24:36,774 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:24:36,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:36,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:36,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:36,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:36,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:36,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:36,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:36,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:36,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,844 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:24:36,903 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:24:36,905 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:24:36,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:36,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:36,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:36,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:36,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:36,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:36,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:36,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,971 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:24:36,972 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:24:36,973 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:24:36,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:36,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:36,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:36,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:36,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:36,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:36,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:37,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:37,009 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:37,009 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:37,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,024 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:24:37,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:37,029 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:37,029 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:37,029 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:24:37,051 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:24:37,070 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:24:37,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:37,080 INFO L390 LassoCheck]: Loop: "assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 > 0);" [2022-02-21 03:24:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#unseeded} assume { :begin_inline_ULTIMATE.init } true; {263#unseeded} is VALID [2022-02-21 03:24:37,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {263#unseeded} is VALID [2022-02-21 03:24:37,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {263#unseeded} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; {263#unseeded} is VALID [2022-02-21 03:24:37,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,120 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; {293#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:37,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} assume !!(main_~i~0#1 > 0); {276#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:37,188 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:24:37,189 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:24:37,192 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:24:37,192 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,193 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:24:37,193 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:24:37,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 18 transitions. Complement of second has 5 states. [2022-02-21 03:24:37,205 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:24:37,205 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,205 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:24:37,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-02-21 03:24:37,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,207 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,207 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,207 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:24:37,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,208 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:37,208 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,208 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,209 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,209 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 1 letters. [2022-02-21 03:24:37,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,210 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:37,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,211 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:24:37,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:37,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,211 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:24:37,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,212 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:24:37,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,213 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,214 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:24:37,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,214 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 1 letters. [2022-02-21 03:24:37,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,215 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,216 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:24:37,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,216 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,217 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:24:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:24:37,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,217 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#unseeded} assume { :begin_inline_ULTIMATE.init } true; {263#unseeded} is VALID [2022-02-21 03:24:37,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {263#unseeded} is VALID [2022-02-21 03:24:37,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {263#unseeded} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; {263#unseeded} is VALID [2022-02-21 03:24:37,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,246 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; {334#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:37,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} assume !!(main_~i~0#1 > 0); {276#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:37,298 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:24:37,298 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:24:37,301 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:24:37,301 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,302 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:37,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:24:37,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 13 states and 18 transitions. Complement of second has 5 states. [2022-02-21 03:24:37,318 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:24:37,318 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,318 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:24:37,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,319 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 [2022-02-21 03:24:37,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:37,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,322 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:24:37,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,323 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:37,323 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:37,323 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,324 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,324 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:24:37,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,325 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,326 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 13 letters. Loop has 13 letters. [2022-02-21 03:24:37,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:37,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,326 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:24:37,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,327 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:24:37,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,328 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,328 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:24:37,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,329 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:24:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,330 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,330 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:24:37,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,331 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,331 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:24:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-02-21 03:24:37,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,332 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#unseeded} assume { :begin_inline_ULTIMATE.init } true; {263#unseeded} is VALID [2022-02-21 03:24:37,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {263#unseeded} is VALID [2022-02-21 03:24:37,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {263#unseeded} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1;main_~i~0#1 := main_~i~0#1 - 1; {263#unseeded} is VALID [2022-02-21 03:24:37,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {263#unseeded} assume !!(main_~i~0#1 > 0); {263#unseeded} is VALID [2022-02-21 03:24:37,358 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:24:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,360 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(>= oldRank0 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 > 0;main_~j~0#1 := main_~j~0#1 - 1; {374#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:37,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) oldRank0))} assume !!(main_~i~0#1 > 0); {276#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~j~0#1|)) unseeded)} is VALID [2022-02-21 03:24:37,388 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:24:37,388 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:24:37,391 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:24:37,391 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,391 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:37,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:24:37,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 18 states and 23 transitions. Complement of second has 4 states. [2022-02-21 03:24:37,403 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:24:37,403 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,403 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:24:37,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:24:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:37,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:37,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:37,404 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,404 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:24:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:37,404 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:37,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:37,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:37,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:37,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,405 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,405 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 1 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 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 18 letters. Loop has 18 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 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:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 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:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 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 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 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:24:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,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 1 letters. [2022-02-21 03:24:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,408 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,408 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:24:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:37,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:37,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:37,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:37,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:37,410 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:37,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:37,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:37,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:37,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:37 BoogieIcfgContainer [2022-02-21 03:24:37,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:37,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:37,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:37,416 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:37,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34" (3/4) ... [2022-02-21 03:24:37,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:37,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:37,418 INFO L158 Benchmark]: Toolchain (without parser) took 3704.23ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.3MB in the beginning and 82.9MB in the end (delta: -11.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:37,418 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 76.4MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:37,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.17ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 82.1MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:37,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.45ms. Allocated memory is still 104.9MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:37,419 INFO L158 Benchmark]: Boogie Preprocessor took 14.07ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 80.1MB in the end (delta: 565.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:37,419 INFO L158 Benchmark]: RCFGBuilder took 220.34ms. Allocated memory is still 104.9MB. Free memory was 79.5MB in the beginning and 71.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:37,420 INFO L158 Benchmark]: BuchiAutomizer took 3267.43ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.1MB in the beginning and 82.9MB in the end (delta: -11.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-02-21 03:24:37,420 INFO L158 Benchmark]: Witness Printer took 2.08ms. Allocated memory is still 125.8MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:37,421 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 76.4MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.17ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 82.1MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.45ms. Allocated memory is still 104.9MB. Free memory was 82.1MB in the beginning and 81.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.07ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 80.1MB in the end (delta: 565.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 220.34ms. Allocated memory is still 104.9MB. Free memory was 79.5MB in the beginning and 71.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3267.43ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.1MB in the beginning and 82.9MB in the end (delta: -11.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Witness Printer took 2.08ms. Allocated memory is still 125.8MB. Free memory is still 82.9MB. 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 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. 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 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 24 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax185 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:37,447 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