./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Narrowing.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 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:43:04,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:43:04,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:43:04,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:43:04,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:43:04,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:43:04,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:43:04,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:43:04,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:43:04,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:43:04,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:43:04,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:43:04,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:43:04,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:43:04,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:43:04,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:43:04,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:43:04,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:43:04,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:43:04,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:43:04,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:43:04,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:43:04,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:43:04,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:43:04,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:43:04,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:43:04,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:43:04,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:43:04,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:43:04,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:43:04,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:43:04,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:43:04,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:43:04,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:43:04,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:43:04,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:43:04,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:43:04,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:43:04,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:43:04,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:43:04,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:43:04,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-17 09:43:04,684 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:43:04,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:43:04,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:43:04,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:43:04,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:43:04,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:43:04,686 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:43:04,687 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-17 09:43:04,687 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-17 09:43:04,687 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-17 09:43:04,688 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-17 09:43:04,688 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-17 09:43:04,688 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-17 09:43:04,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:43:04,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-17 09:43:04,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:43:04,690 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-17 09:43:04,690 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:43:04,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-17 09:43:04,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:43:04,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:43:04,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:43:04,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:43:04,692 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-17 09:43:04,693 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 -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2023-02-17 09:43:04,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:43:04,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:43:04,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:43:04,971 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:43:04,971 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:43:04,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-17 09:43:06,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:43:06,409 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:43:06,409 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-17 09:43:06,416 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc90237d/cc5b72b03171472997d4ea1ecca44b20/FLAG723603a8e [2023-02-17 09:43:06,428 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc90237d/cc5b72b03171472997d4ea1ecca44b20 [2023-02-17 09:43:06,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:43:06,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:43:06,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:43:06,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:43:06,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:43:06,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e540c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06, skipping insertion in model container [2023-02-17 09:43:06,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:43:06,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:43:06,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:43:06,571 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:43:06,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:43:06,592 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:43:06,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06 WrapperNode [2023-02-17 09:43:06,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:43:06,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:43:06,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:43:06,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:43:06,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,617 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-17 09:43:06,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:43:06,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:43:06,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:43:06,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:43:06,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,634 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:43:06,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:43:06,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:43:06,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:43:06,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (1/1) ... [2023-02-17 09:43:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:06,670 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) [2023-02-17 09:43:06,675 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 [2023-02-17 09:43:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:43:06,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:43:06,766 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:43:06,768 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:43:06,897 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:43:06,903 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:43:06,903 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 09:43:06,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:06 BoogieIcfgContainer [2023-02-17 09:43:06,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:43:06,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-17 09:43:06,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-17 09:43:06,909 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-17 09:43:06,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:06,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.02 09:43:06" (1/3) ... [2023-02-17 09:43:06,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30608e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:43:06, skipping insertion in model container [2023-02-17 09:43:06,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:06,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:43:06" (2/3) ... [2023-02-17 09:43:06,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30608e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:43:06, skipping insertion in model container [2023-02-17 09:43:06,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:06,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:06" (3/3) ... [2023-02-17 09:43:06,919 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2023-02-17 09:43:06,998 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-17 09:43:06,999 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-17 09:43:06,999 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-17 09:43:06,999 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-17 09:43:06,999 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-17 09:43:06,999 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-17 09:43:06,999 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-17 09:43:06,999 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-17 09:43:07,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:43:07,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:07,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:07,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:07,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:07,052 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-17 09:43:07,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:43:07,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:07,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:07,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:07,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:07,063 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true 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_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2023-02-17 09:43:07,063 INFO L750 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2023-02-17 09:43:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-17 09:43:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636123798] [2023-02-17 09:43:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2023-02-17 09:43:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051858830] [2023-02-17 09:43:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:07,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051858830] [2023-02-17 09:43:07,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051858830] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:07,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:07,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:43:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134200312] [2023-02-17 09:43:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:07,236 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:43:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:43:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:43:07,277 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:07,328 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2023-02-17 09:43:07,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2023-02-17 09:43:07,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:07,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2023-02-17 09:43:07,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-17 09:43:07,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-17 09:43:07,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-02-17 09:43:07,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:43:07,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-17 09:43:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-02-17 09:43:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-17 09:43:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-02-17 09:43:07,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-17 09:43:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:43:07,375 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-17 09:43:07,375 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-17 09:43:07,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-02-17 09:43:07,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:07,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:07,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:07,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:07,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:07,377 INFO L748 eck$LassoCheckResult]: Stem: 45#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 46#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 50#L26-1 [2023-02-17 09:43:07,379 INFO L750 eck$LassoCheckResult]: Loop: 50#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 56#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 53#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 51#L17-1 assume !(1 == main_~up~0#1); 52#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 48#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 50#L26-1 [2023-02-17 09:43:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-17 09:43:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882326236] [2023-02-17 09:43:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2023-02-17 09:43:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587769284] [2023-02-17 09:43:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:07,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587769284] [2023-02-17 09:43:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587769284] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:07,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:07,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:43:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426255380] [2023-02-17 09:43:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:07,430 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:43:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:43:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:43:07,431 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:07,477 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-02-17 09:43:07,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2023-02-17 09:43:07,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-17 09:43:07,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2023-02-17 09:43:07,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-17 09:43:07,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-17 09:43:07,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2023-02-17 09:43:07,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:43:07,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-17 09:43:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2023-02-17 09:43:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 09:43:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-02-17 09:43:07,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-17 09:43:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:43:07,489 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-17 09:43:07,493 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-17 09:43:07,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2023-02-17 09:43:07,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-17 09:43:07,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:07,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:07,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:07,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:07,496 INFO L748 eck$LassoCheckResult]: Stem: 104#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 109#L26-1 [2023-02-17 09:43:07,496 INFO L750 eck$LassoCheckResult]: Loop: 109#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 126#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 123#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 120#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 121#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 118#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 109#L26-1 [2023-02-17 09:43:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-17 09:43:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437252315] [2023-02-17 09:43:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2023-02-17 09:43:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099183132] [2023-02-17 09:43:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:07,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099183132] [2023-02-17 09:43:07,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099183132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:07,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:07,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:43:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139019184] [2023-02-17 09:43:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:07,566 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:43:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:07,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:43:07,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:43:07,567 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:07,587 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2023-02-17 09:43:07,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2023-02-17 09:43:07,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-17 09:43:07,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2023-02-17 09:43:07,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-17 09:43:07,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-17 09:43:07,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2023-02-17 09:43:07,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:43:07,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-02-17 09:43:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2023-02-17 09:43:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-17 09:43:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-17 09:43:07,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-17 09:43:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:43:07,606 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-17 09:43:07,606 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-17 09:43:07,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-17 09:43:07,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-17 09:43:07,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:07,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:07,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:07,608 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:07,608 INFO L748 eck$LassoCheckResult]: Stem: 186#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 190#L26-1 [2023-02-17 09:43:07,608 INFO L750 eck$LassoCheckResult]: Loop: 190#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 201#L14 assume !(0 == main_~i~0#1); 207#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 205#L17-1 assume !(1 == main_~up~0#1); 204#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 202#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 190#L26-1 [2023-02-17 09:43:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-02-17 09:43:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463048916] [2023-02-17 09:43:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2023-02-17 09:43:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630276429] [2023-02-17 09:43:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2023-02-17 09:43:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47135192] [2023-02-17 09:43:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,668 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:07,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:07,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:07,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:07,669 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:07,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:07,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:07,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-17 09:43:07,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:07,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:07,693 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,713 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:07,746 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:07,755 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) [2023-02-17 09:43:07,756 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 [2023-02-17 09:43:07,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:07,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:07,786 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:07,787 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: [] [2023-02-17 09:43:07,792 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 [2023-02-17 09:43:07,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:07,838 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) [2023-02-17 09:43:07,841 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 [2023-02-17 09:43:07,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:07,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:07,857 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:07,857 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: [] [2023-02-17 09:43:07,863 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 [2023-02-17 09:43:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:07,865 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) [2023-02-17 09:43:07,867 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 [2023-02-17 09:43:07,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:07,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:07,907 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 [2023-02-17 09:43:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:07,909 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) [2023-02-17 09:43:07,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:07,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:07,932 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 [2023-02-17 09:43:07,946 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:07,953 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 [2023-02-17 09:43:07,954 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:07,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:07,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:07,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:07,955 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:07,955 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:07,955 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:07,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:07,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-17 09:43:07,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:07,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:07,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:07,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:08,012 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,015 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) [2023-02-17 09:43:08,038 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 [2023-02-17 09:43:08,038 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 [2023-02-17 09:43:08,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:08,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:08,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:08,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-17 09:43:08,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,080 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) [2023-02-17 09:43:08,084 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 [2023-02-17 09:43:08,085 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 [2023-02-17 09:43:08,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:08,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,093 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:08,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,102 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:08,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:08,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:08,127 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:43:08,127 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:08,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,130 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) [2023-02-17 09:43:08,131 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 [2023-02-17 09:43:08,133 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:08,133 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:08,133 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:08,134 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 [] [2023-02-17 09:43:08,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:08,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:08,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:08,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:08,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:43:08,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:08,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:08,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2023-02-17 09:43:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-17 09:43:08,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-17 09:43:08,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:08,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2023-02-17 09:43:08,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:08,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2023-02-17 09:43:08,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:08,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2023-02-17 09:43:08,262 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2023-02-17 09:43:08,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2023-02-17 09:43:08,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-02-17 09:43:08,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-02-17 09:43:08,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2023-02-17 09:43:08,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:08,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-02-17 09:43:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2023-02-17 09:43:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-02-17 09:43:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2023-02-17 09:43:08,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-17 09:43:08,274 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-17 09:43:08,274 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-17 09:43:08,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2023-02-17 09:43:08,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2023-02-17 09:43:08,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:08,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:08,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-17 09:43:08,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:08,277 INFO L748 eck$LassoCheckResult]: Stem: 367#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 378#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2023-02-17 09:43:08,277 INFO L750 eck$LassoCheckResult]: Loop: 386#L14 assume !(0 == main_~i~0#1); 437#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 433#L17-1 assume !(1 == main_~up~0#1); 430#L20-1 assume !(0 == main_~up~0#1); 426#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 425#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2023-02-17 09:43:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-17 09:43:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352181145] [2023-02-17 09:43:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2023-02-17 09:43:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926680185] [2023-02-17 09:43:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2023-02-17 09:43:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181219756] [2023-02-17 09:43:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:08,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:08,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181219756] [2023-02-17 09:43:08,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181219756] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:08,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:08,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:43:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064330950] [2023-02-17 09:43:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:43:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:43:08,319 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:08,329 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-02-17 09:43:08,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2023-02-17 09:43:08,331 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-17 09:43:08,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2023-02-17 09:43:08,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-17 09:43:08,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-17 09:43:08,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2023-02-17 09:43:08,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:08,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2023-02-17 09:43:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2023-02-17 09:43:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-02-17 09:43:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2023-02-17 09:43:08,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-17 09:43:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:43:08,339 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-17 09:43:08,340 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-17 09:43:08,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2023-02-17 09:43:08,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-17 09:43:08,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:08,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:08,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-17 09:43:08,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:08,342 INFO L748 eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 552#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 570#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 584#L14-2 [2023-02-17 09:43:08,342 INFO L750 eck$LassoCheckResult]: Loop: 584#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 595#L17-1 assume !(1 == main_~up~0#1); 593#L20-1 assume !(0 == main_~up~0#1); 590#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 538#L14 assume !(0 == main_~i~0#1); 584#L14-2 [2023-02-17 09:43:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-17 09:43:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998596861] [2023-02-17 09:43:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2023-02-17 09:43:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190180591] [2023-02-17 09:43:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2023-02-17 09:43:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620643171] [2023-02-17 09:43:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:08,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620643171] [2023-02-17 09:43:08,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620643171] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:08,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:08,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:43:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849894654] [2023-02-17 09:43:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:43:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:43:08,381 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-17 09:43:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:08,390 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-02-17 09:43:08,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2023-02-17 09:43:08,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-17 09:43:08,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2023-02-17 09:43:08,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-17 09:43:08,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-17 09:43:08,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2023-02-17 09:43:08,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:08,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-02-17 09:43:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2023-02-17 09:43:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2023-02-17 09:43:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-02-17 09:43:08,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-17 09:43:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:43:08,397 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-17 09:43:08,397 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-17 09:43:08,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2023-02-17 09:43:08,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-17 09:43:08,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:08,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:08,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:43:08,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:08,399 INFO L748 eck$LassoCheckResult]: Stem: 663#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 676#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 677#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 678#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2023-02-17 09:43:08,399 INFO L750 eck$LassoCheckResult]: Loop: 685#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 665#L20-1 assume !(0 == main_~up~0#1); 666#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 691#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 689#L14 assume !(0 == main_~i~0#1); 687#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2023-02-17 09:43:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-17 09:43:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303866673] [2023-02-17 09:43:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2023-02-17 09:43:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376716115] [2023-02-17 09:43:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2023-02-17 09:43:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639972109] [2023-02-17 09:43:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:08,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:08,431 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:08,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:08,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:08,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:08,431 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:08,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:08,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:08,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-17 09:43:08,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:08,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:08,433 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,435 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,436 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,436 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:08,441 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:08,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,443 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) [2023-02-17 09:43:08,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:08,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:08,474 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 [2023-02-17 09:43:08,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:08,475 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: [] [2023-02-17 09:43:08,482 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 [2023-02-17 09:43:08,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,484 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) [2023-02-17 09:43:08,488 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 [2023-02-17 09:43:08,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:08,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:08,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:08,510 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: [] [2023-02-17 09:43:08,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-17 09:43:08,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,518 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) [2023-02-17 09:43:08,525 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 [2023-02-17 09:43:08,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:08,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:08,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:08,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:43:08,557 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 [2023-02-17 09:43:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,559 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) [2023-02-17 09:43:08,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:08,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:08,573 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 [2023-02-17 09:43:08,599 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 [2023-02-17 09:43:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,601 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) [2023-02-17 09:43:08,605 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 [2023-02-17 09:43:08,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:08,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:08,793 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:08,797 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 [2023-02-17 09:43:08,797 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:08,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:08,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:08,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:08,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:08,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:08,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:08,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-17 09:43:08,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:08,798 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:08,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,813 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:08,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:08,825 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,827 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) [2023-02-17 09:43:08,833 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 [2023-02-17 09:43:08,836 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 [2023-02-17 09:43:08,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:08,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:08,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:08,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:08,873 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 [2023-02-17 09:43:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,874 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) [2023-02-17 09:43:08,877 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 [2023-02-17 09:43:08,880 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 [2023-02-17 09:43:08,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:08,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:08,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:08,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:08,905 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 [2023-02-17 09:43:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,906 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) [2023-02-17 09:43:08,907 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 [2023-02-17 09:43:08,910 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 [2023-02-17 09:43:08,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:08,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,917 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:08,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,919 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:08,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:08,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:08,945 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 [2023-02-17 09:43:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:08,950 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) [2023-02-17 09:43:08,954 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 [2023-02-17 09:43:08,955 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 [2023-02-17 09:43:08,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:08,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:08,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:08,965 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:08,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:08,969 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:08,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:08,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:08,998 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-17 09:43:08,999 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:08,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,001 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) [2023-02-17 09:43:09,002 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 [2023-02-17 09:43:09,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:09,004 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:09,004 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:09,004 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-17 09:43:09,008 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 [2023-02-17 09:43:09,008 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:09,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-02-17 09:43:09,124 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 91 states and 124 transitions. Complement of second has 7 states. [2023-02-17 09:43:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-02-17 09:43:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-17 09:43:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2023-02-17 09:43:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-17 09:43:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2023-02-17 09:43:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2023-02-17 09:43:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-17 09:43:09,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2023-02-17 09:43:09,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-17 09:43:09,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-17 09:43:09,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2023-02-17 09:43:09,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:09,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-02-17 09:43:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2023-02-17 09:43:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-02-17 09:43:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2023-02-17 09:43:09,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-17 09:43:09,134 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-17 09:43:09,135 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-17 09:43:09,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2023-02-17 09:43:09,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-17 09:43:09,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:09,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:09,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:43:09,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:09,136 INFO L748 eck$LassoCheckResult]: Stem: 853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 865#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 905#L14 assume !(0 == main_~i~0#1); 906#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 863#L17-1 assume !(1 == main_~up~0#1); 864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 896#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 898#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 919#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 918#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2023-02-17 09:43:09,136 INFO L750 eck$LassoCheckResult]: Loop: 917#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 916#L20-1 assume !(0 == main_~up~0#1); 859#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 860#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 884#L14 assume !(0 == main_~i~0#1); 882#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2023-02-17 09:43:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2023-02-17 09:43:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:09,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939450366] [2023-02-17 09:43:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:09,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939450366] [2023-02-17 09:43:09,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939450366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:09,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980454781] [2023-02-17 09:43:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:09,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:09,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-17 09:43:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980454781] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:09,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:09,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-17 09:43:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764921332] [2023-02-17 09:43:09,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:09,246 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2023-02-17 09:43:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:09,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532966235] [2023-02-17 09:43:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:09,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:09,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:09,271 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 [2023-02-17 09:43:09,289 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 [2023-02-17 09:43:09,290 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:09,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:09,290 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:09,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:09,290 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:09,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:09,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:09,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-17 09:43:09,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:09,291 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:09,292 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,296 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,296 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:09,313 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:09,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,318 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) [2023-02-17 09:43:09,321 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 [2023-02-17 09:43:09,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:09,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:09,343 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 [2023-02-17 09:43:09,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,345 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) [2023-02-17 09:43:09,347 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 [2023-02-17 09:43:09,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:09,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:09,522 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:09,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-17 09:43:09,526 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:09,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:09,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:09,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:09,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:09,527 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,527 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:09,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:09,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-17 09:43:09,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:09,527 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:09,528 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,532 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:09,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:09,542 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:09,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,544 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) [2023-02-17 09:43:09,552 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 [2023-02-17 09:43:09,552 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 [2023-02-17 09:43:09,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:09,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:09,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:09,561 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:09,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:09,565 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:09,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:09,578 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:09,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:43:09,582 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-17 09:43:09,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,585 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) [2023-02-17 09:43:09,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:09,594 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:09,595 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:09,595 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-17 09:43:09,599 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 [2023-02-17 09:43:09,602 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 [2023-02-17 09:43:09,603 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,661 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:09,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Result 96 states and 136 transitions. Complement of second has 7 states. [2023-02-17 09:43:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-17 09:43:09,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-17 09:43:09,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,715 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:43:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:09,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Result 125 states and 174 transitions. Complement of second has 9 states. [2023-02-17 09:43:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-02-17 09:43:09,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-17 09:43:09,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,819 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:43:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:09,874 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:09,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Result 113 states and 165 transitions. Complement of second has 8 states. [2023-02-17 09:43:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2023-02-17 09:43:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-02-17 09:43:09,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-17 09:43:09,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-17 09:43:09,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2023-02-17 09:43:09,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:09,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2023-02-17 09:43:09,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-17 09:43:09,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2023-02-17 09:43:09,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-17 09:43:09,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-02-17 09:43:09,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2023-02-17 09:43:09,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:09,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2023-02-17 09:43:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2023-02-17 09:43:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-02-17 09:43:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-02-17 09:43:09,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-02-17 09:43:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:43:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:43:09,932 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:10,004 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2023-02-17 09:43:10,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2023-02-17 09:43:10,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2023-02-17 09:43:10,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2023-02-17 09:43:10,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-02-17 09:43:10,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-02-17 09:43:10,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2023-02-17 09:43:10,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:10,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2023-02-17 09:43:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2023-02-17 09:43:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2023-02-17 09:43:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2023-02-17 09:43:10,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-17 09:43:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 09:43:10,026 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-17 09:43:10,027 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-17 09:43:10,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2023-02-17 09:43:10,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2023-02-17 09:43:10,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:10,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:10,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:43:10,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-17 09:43:10,029 INFO L748 eck$LassoCheckResult]: Stem: 1787#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1788#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1793#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1867#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1866#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1849#L17-1 [2023-02-17 09:43:10,029 INFO L750 eck$LassoCheckResult]: Loop: 1849#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1862#L20-1 assume !(0 == main_~up~0#1); 1860#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1856#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1851#L14 assume !(0 == main_~i~0#1); 1848#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1838#L17-1 assume !(1 == main_~up~0#1); 1846#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1847#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1845#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume !(0 == main_~i~0#1); 1837#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1834#L17-1 assume !(1 == main_~up~0#1); 1832#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1829#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1830#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1841#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1842#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1849#L17-1 [2023-02-17 09:43:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2023-02-17 09:43:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515688310] [2023-02-17 09:43:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:10,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:10,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2023-02-17 09:43:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146131141] [2023-02-17 09:43:10,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:10,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146131141] [2023-02-17 09:43:10,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146131141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:10,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148811514] [2023-02-17 09:43:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:10,180 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:10,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-17 09:43:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:10,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:43:10,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148811514] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:10,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:10,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-02-17 09:43:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067395933] [2023-02-17 09:43:10,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:10,279 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:43:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 09:43:10,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:43:10,280 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:10,447 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-02-17 09:43:10,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2023-02-17 09:43:10,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-17 09:43:10,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2023-02-17 09:43:10,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-17 09:43:10,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-02-17 09:43:10,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2023-02-17 09:43:10,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:10,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-02-17 09:43:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2023-02-17 09:43:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-17 09:43:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-02-17 09:43:10,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-17 09:43:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:43:10,453 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-17 09:43:10,453 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-17 09:43:10,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2023-02-17 09:43:10,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-17 09:43:10,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:10,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:10,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2023-02-17 09:43:10,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:43:10,455 INFO L748 eck$LassoCheckResult]: Stem: 2200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2206#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2231#L14 assume !(0 == main_~i~0#1); 2229#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2227#L17-1 assume !(1 == main_~up~0#1); 2225#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2220#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2219#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2213#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2267#L17-1 assume !(1 == main_~up~0#1); 2266#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2265#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2250#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2260#L14 assume !(0 == main_~i~0#1); 2258#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2256#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2249#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2243#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2023-02-17 09:43:10,456 INFO L750 eck$LassoCheckResult]: Loop: 2244#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2208#L20-1 assume !(0 == main_~up~0#1); 2273#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2272#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2271#L14 assume !(0 == main_~i~0#1); 2269#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2268#L17-1 assume !(1 == main_~up~0#1); 2254#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2251#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2245#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2246#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2023-02-17 09:43:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2023-02-17 09:43:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45191961] [2023-02-17 09:43:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:10,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45191961] [2023-02-17 09:43:10,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45191961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:10,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695767831] [2023-02-17 09:43:10,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:43:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:10,504 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:10,518 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 [2023-02-17 09:43:10,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-17 09:43:10,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:43:10,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:10,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:10,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695767831] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:10,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:10,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-02-17 09:43:10,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080761911] [2023-02-17 09:43:10,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:10,606 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2023-02-17 09:43:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773162773] [2023-02-17 09:43:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:10,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:10,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 09:43:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:43:10,628 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:10,768 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2023-02-17 09:43:10,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 187 transitions. [2023-02-17 09:43:10,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-17 09:43:10,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 165 states and 177 transitions. [2023-02-17 09:43:10,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2023-02-17 09:43:10,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2023-02-17 09:43:10,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 177 transitions. [2023-02-17 09:43:10,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:10,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 177 transitions. [2023-02-17 09:43:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 177 transitions. [2023-02-17 09:43:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2023-02-17 09:43:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.080536912751678) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2023-02-17 09:43:10,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-17 09:43:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 09:43:10,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-17 09:43:10,780 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-17 09:43:10,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 161 transitions. [2023-02-17 09:43:10,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-17 09:43:10,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:10,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:10,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1] [2023-02-17 09:43:10,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:43:10,784 INFO L748 eck$LassoCheckResult]: Stem: 2623#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2636#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume !(0 == main_~i~0#1); 2647#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2646#L17-1 assume !(1 == main_~up~0#1); 2645#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2642#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2641#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2638#L14 assume !(0 == main_~i~0#1); 2639#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2634#L17-1 assume !(1 == main_~up~0#1); 2635#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2745#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2744#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2743#L14 assume !(0 == main_~i~0#1); 2742#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2741#L17-1 assume !(1 == main_~up~0#1); 2740#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2739#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2738#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2737#L14 assume !(0 == main_~i~0#1); 2736#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2735#L17-1 assume !(1 == main_~up~0#1); 2734#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2733#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2732#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2731#L14 assume !(0 == main_~i~0#1); 2730#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2729#L17-1 assume !(1 == main_~up~0#1); 2728#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2727#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2726#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2725#L14 assume !(0 == main_~i~0#1); 2724#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2723#L17-1 assume !(1 == main_~up~0#1); 2722#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2721#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2720#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2719#L14 assume !(0 == main_~i~0#1); 2718#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2717#L17-1 assume !(1 == main_~up~0#1); 2716#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2715#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2667#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2688#L14 assume !(0 == main_~i~0#1); 2676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2670#L17-1 assume !(1 == main_~up~0#1); 2668#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2665#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2666#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2673#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2669#L14-2 [2023-02-17 09:43:10,784 INFO L750 eck$LassoCheckResult]: Loop: 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2632#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2633#L20-1 assume !(0 == main_~up~0#1); 2685#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2684#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2683#L14 assume !(0 == main_~i~0#1); 2682#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2681#L17-1 assume !(1 == main_~up~0#1); 2680#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2678#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2674#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2675#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2669#L14-2 [2023-02-17 09:43:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 118659310, now seen corresponding path program 3 times [2023-02-17 09:43:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084160828] [2023-02-17 09:43:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084160828] [2023-02-17 09:43:10,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084160828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:10,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222768355] [2023-02-17 09:43:10,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:43:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:10,947 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:10,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-17 09:43:10,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-17 09:43:10,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:10,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:43:10,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:11,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:11,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222768355] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:11,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:11,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-02-17 09:43:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433551579] [2023-02-17 09:43:11,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:11,170 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2023-02-17 09:43:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799092815] [2023-02-17 09:43:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 09:43:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=282, Unknown=0, NotChecked=0, Total=462 [2023-02-17 09:43:11,183 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. cyclomatic complexity: 16 Second operand has 22 states, 21 states have (on average 5.523809523809524) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:11,411 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2023-02-17 09:43:11,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 309 transitions. [2023-02-17 09:43:11,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-17 09:43:11,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 277 states and 289 transitions. [2023-02-17 09:43:11,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2023-02-17 09:43:11,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2023-02-17 09:43:11,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 289 transitions. [2023-02-17 09:43:11,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:11,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 277 states and 289 transitions. [2023-02-17 09:43:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 289 transitions. [2023-02-17 09:43:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 269. [2023-02-17 09:43:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 1.0446096654275092) internal successors, (281), 268 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 281 transitions. [2023-02-17 09:43:11,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 281 transitions. [2023-02-17 09:43:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 09:43:11,421 INFO L428 stractBuchiCegarLoop]: Abstraction has 269 states and 281 transitions. [2023-02-17 09:43:11,421 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-17 09:43:11,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 281 transitions. [2023-02-17 09:43:11,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-17 09:43:11,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:11,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:11,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 18, 17, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1] [2023-02-17 09:43:11,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-17 09:43:11,425 INFO L748 eck$LassoCheckResult]: Stem: 3428#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3434#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3457#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3461#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3459#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3432#L20-1 assume !(0 == main_~up~0#1); 3433#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3464#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3478#L14 assume !(0 == main_~i~0#1); 3475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3476#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3430#L20-1 assume !(0 == main_~up~0#1); 3431#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3439#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3690#L14 assume !(0 == main_~i~0#1); 3688#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3686#L17-1 assume !(1 == main_~up~0#1); 3684#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3682#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3680#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3679#L14 assume !(0 == main_~i~0#1); 3678#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3677#L17-1 assume !(1 == main_~up~0#1); 3676#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3675#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3674#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3673#L14 assume !(0 == main_~i~0#1); 3672#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3671#L17-1 assume !(1 == main_~up~0#1); 3670#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3669#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3668#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3667#L14 assume !(0 == main_~i~0#1); 3666#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3665#L17-1 assume !(1 == main_~up~0#1); 3664#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3663#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3662#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3661#L14 assume !(0 == main_~i~0#1); 3660#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3659#L17-1 assume !(1 == main_~up~0#1); 3658#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3657#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3655#L14 assume !(0 == main_~i~0#1); 3654#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3653#L17-1 assume !(1 == main_~up~0#1); 3652#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3651#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3650#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3649#L14 assume !(0 == main_~i~0#1); 3648#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3647#L17-1 assume !(1 == main_~up~0#1); 3646#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3645#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3644#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3643#L14 assume !(0 == main_~i~0#1); 3642#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3641#L17-1 assume !(1 == main_~up~0#1); 3640#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3639#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3638#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3637#L14 assume !(0 == main_~i~0#1); 3636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3635#L17-1 assume !(1 == main_~up~0#1); 3634#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3633#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3632#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3631#L14 assume !(0 == main_~i~0#1); 3630#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3629#L17-1 assume !(1 == main_~up~0#1); 3628#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3627#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3626#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3625#L14 assume !(0 == main_~i~0#1); 3624#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3623#L17-1 assume !(1 == main_~up~0#1); 3622#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3621#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3620#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3619#L14 assume !(0 == main_~i~0#1); 3618#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3617#L17-1 assume !(1 == main_~up~0#1); 3616#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3615#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3614#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3613#L14 assume !(0 == main_~i~0#1); 3612#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3611#L17-1 assume !(1 == main_~up~0#1); 3610#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3609#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3608#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3607#L14 assume !(0 == main_~i~0#1); 3606#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3605#L17-1 assume !(1 == main_~up~0#1); 3604#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3603#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3602#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3601#L14 assume !(0 == main_~i~0#1); 3600#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3599#L17-1 assume !(1 == main_~up~0#1); 3598#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3597#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3596#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3595#L14 assume !(0 == main_~i~0#1); 3594#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3593#L17-1 assume !(1 == main_~up~0#1); 3592#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3591#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3590#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3589#L14 assume !(0 == main_~i~0#1); 3587#L14-2 [2023-02-17 09:43:11,425 INFO L750 eck$LassoCheckResult]: Loop: 3587#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3484#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3482#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3587#L14-2 [2023-02-17 09:43:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1500809642, now seen corresponding path program 1 times [2023-02-17 09:43:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:11,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049178234] [2023-02-17 09:43:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2023-02-17 09:43:11,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:11,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049178234] [2023-02-17 09:43:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049178234] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:11,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:11,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 09:43:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609757232] [2023-02-17 09:43:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:11,527 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1544193778, now seen corresponding path program 1 times [2023-02-17 09:43:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755613760] [2023-02-17 09:43:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:11,536 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:11,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:11,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:11,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:11,536 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:11,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:11,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:11,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2023-02-17 09:43:11,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:11,537 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:11,539 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,540 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,541 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,543 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,547 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:11,547 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:11,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,551 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) [2023-02-17 09:43:11,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:11,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:11,580 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 [2023-02-17 09:43:11,597 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:11,597 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:43:11,604 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 [2023-02-17 09:43:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,605 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2023-02-17 09:43:11,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:11,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-17 09:43:11,635 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:11,636 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:43:11,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:11,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,642 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2023-02-17 09:43:11,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:11,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:11,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-17 09:43:11,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,678 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2023-02-17 09:43:11,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:11,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:11,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-17 09:43:11,814 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:11,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-17 09:43:11,819 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:11,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:11,819 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:11,819 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:11,819 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:11,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:11,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:11,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2023-02-17 09:43:11,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:11,820 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:11,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,822 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,825 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-17 09:43:11,828 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:11,828 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:11,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,830 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-02-17 09:43:11,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-17 09:43:11,834 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 [2023-02-17 09:43:11,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:11,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:11,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:11,841 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:11,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:11,842 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:11,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:11,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:11,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-02-17 09:43:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,848 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-02-17 09:43:11,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-17 09:43:11,852 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 [2023-02-17 09:43:11,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:11,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:11,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:11,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:11,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:11,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:11,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,897 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-02-17 09:43:11,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 [2023-02-17 09:43:11,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:11,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:11,914 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:43:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:11,917 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:43:11,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:11,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-17 09:43:11,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:11,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:43:11,943 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,944 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-02-17 09:43:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-17 09:43:11,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:11,947 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:11,947 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:11,947 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1) = 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-17 09:43:11,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:11,951 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:12,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:12,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:12,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:12,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:12,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-17 09:43:12,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 281 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:12,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 281 transitions. cyclomatic complexity: 16. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 550 states and 592 transitions. Complement of second has 6 states. [2023-02-17 09:43:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-17 09:43:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-02-17 09:43:12,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 112 letters. Loop has 6 letters. [2023-02-17 09:43:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:12,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 118 letters. Loop has 6 letters. [2023-02-17 09:43:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:12,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 112 letters. Loop has 12 letters. [2023-02-17 09:43:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:12,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 550 states and 592 transitions. [2023-02-17 09:43:12,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:12,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 550 states to 324 states and 350 transitions. [2023-02-17 09:43:12,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-02-17 09:43:12,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-17 09:43:12,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 350 transitions. [2023-02-17 09:43:12,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:12,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 324 states and 350 transitions. [2023-02-17 09:43:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 350 transitions. [2023-02-17 09:43:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2023-02-17 09:43:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.077922077922078) internal successors, (332), 307 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 332 transitions. [2023-02-17 09:43:12,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 332 transitions. [2023-02-17 09:43:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:12,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:43:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:43:12,070 INFO L87 Difference]: Start difference. First operand 308 states and 332 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:12,101 INFO L93 Difference]: Finished difference Result 319 states and 342 transitions. [2023-02-17 09:43:12,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 342 transitions. [2023-02-17 09:43:12,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:12,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 313 states and 333 transitions. [2023-02-17 09:43:12,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-17 09:43:12,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-17 09:43:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 333 transitions. [2023-02-17 09:43:12,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:12,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 313 states and 333 transitions. [2023-02-17 09:43:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 333 transitions. [2023-02-17 09:43:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2023-02-17 09:43:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.0627062706270627) internal successors, (322), 302 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 322 transitions. [2023-02-17 09:43:12,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 303 states and 322 transitions. [2023-02-17 09:43:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:43:12,110 INFO L428 stractBuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2023-02-17 09:43:12,110 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-17 09:43:12,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 322 transitions. [2023-02-17 09:43:12,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:12,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:12,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:12,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 18, 18, 1, 1, 1] [2023-02-17 09:43:12,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:43:12,114 INFO L748 eck$LassoCheckResult]: Stem: 5256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 5266#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5285#L14 assume !(0 == main_~i~0#1); 5412#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5410#L17-1 assume !(1 == main_~up~0#1); 5408#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5405#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5403#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5402#L14 assume !(0 == main_~i~0#1); 5401#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5400#L17-1 assume !(1 == main_~up~0#1); 5399#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5398#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5397#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5396#L14 assume !(0 == main_~i~0#1); 5395#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5394#L17-1 assume !(1 == main_~up~0#1); 5393#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5392#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5391#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5390#L14 assume !(0 == main_~i~0#1); 5389#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5388#L17-1 assume !(1 == main_~up~0#1); 5387#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5386#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5385#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5384#L14 assume !(0 == main_~i~0#1); 5383#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5382#L17-1 assume !(1 == main_~up~0#1); 5381#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5380#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5379#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5378#L14 assume !(0 == main_~i~0#1); 5377#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5376#L17-1 assume !(1 == main_~up~0#1); 5375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5374#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5373#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5372#L14 assume !(0 == main_~i~0#1); 5371#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5370#L17-1 assume !(1 == main_~up~0#1); 5369#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5368#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5367#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5366#L14 assume !(0 == main_~i~0#1); 5365#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5364#L17-1 assume !(1 == main_~up~0#1); 5363#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5362#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5361#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5360#L14 assume !(0 == main_~i~0#1); 5359#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5358#L17-1 assume !(1 == main_~up~0#1); 5357#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5356#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5355#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5354#L14 assume !(0 == main_~i~0#1); 5353#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5352#L17-1 assume !(1 == main_~up~0#1); 5351#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5350#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5349#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5348#L14 assume !(0 == main_~i~0#1); 5347#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5346#L17-1 assume !(1 == main_~up~0#1); 5345#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5344#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5343#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5342#L14 assume !(0 == main_~i~0#1); 5341#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5340#L17-1 assume !(1 == main_~up~0#1); 5339#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5338#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5337#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5336#L14 assume !(0 == main_~i~0#1); 5335#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5334#L17-1 assume !(1 == main_~up~0#1); 5333#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5332#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5331#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5330#L14 assume !(0 == main_~i~0#1); 5329#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5328#L17-1 assume !(1 == main_~up~0#1); 5327#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5326#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5325#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5324#L14 assume !(0 == main_~i~0#1); 5323#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5322#L17-1 assume !(1 == main_~up~0#1); 5321#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5320#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5319#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5318#L14 assume !(0 == main_~i~0#1); 5317#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5316#L17-1 assume !(1 == main_~up~0#1); 5315#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5314#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5313#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5312#L14 assume !(0 == main_~i~0#1); 5311#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5310#L17-1 assume !(1 == main_~up~0#1); 5309#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5308#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5298#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5306#L14 assume !(0 == main_~i~0#1); 5304#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5302#L17-1 assume !(1 == main_~up~0#1); 5300#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5297#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5294#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5280#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5278#L14-2 [2023-02-17 09:43:12,114 INFO L750 eck$LassoCheckResult]: Loop: 5278#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5276#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5258#L20-1 assume !(0 == main_~up~0#1); 5259#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5264#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5283#L14 assume !(0 == main_~i~0#1); 5279#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5277#L17-1 assume !(1 == main_~up~0#1); 5274#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5275#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5284#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5282#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5278#L14-2 [2023-02-17 09:43:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 123059224, now seen corresponding path program 4 times [2023-02-17 09:43:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:12,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417121721] [2023-02-17 09:43:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:12,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-02-17 09:43:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417121721] [2023-02-17 09:43:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417121721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:12,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425670494] [2023-02-17 09:43:12,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:43:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:12,605 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:12,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-17 09:43:12,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:43:12,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:12,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 09:43:12,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:12,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:13,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425670494] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:13,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:13,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 24 [2023-02-17 09:43:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966062620] [2023-02-17 09:43:13,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:13,116 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2023-02-17 09:43:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:13,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065945362] [2023-02-17 09:43:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 09:43:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2023-02-17 09:43:13,129 INFO L87 Difference]: Start difference. First operand 303 states and 322 transitions. cyclomatic complexity: 25 Second operand has 25 states, 24 states have (on average 4.958333333333333) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:13,289 INFO L93 Difference]: Finished difference Result 423 states and 442 transitions. [2023-02-17 09:43:13,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 442 transitions. [2023-02-17 09:43:13,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:13,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 421 states and 440 transitions. [2023-02-17 09:43:13,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-17 09:43:13,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-17 09:43:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 440 transitions. [2023-02-17 09:43:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:13,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 421 states and 440 transitions. [2023-02-17 09:43:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 440 transitions. [2023-02-17 09:43:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 315. [2023-02-17 09:43:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.0603174603174603) internal successors, (334), 314 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 334 transitions. [2023-02-17 09:43:13,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 334 transitions. [2023-02-17 09:43:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 09:43:13,300 INFO L428 stractBuchiCegarLoop]: Abstraction has 315 states and 334 transitions. [2023-02-17 09:43:13,301 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-17 09:43:13,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 334 transitions. [2023-02-17 09:43:13,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:13,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:13,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:13,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2023-02-17 09:43:13,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:43:13,304 INFO L748 eck$LassoCheckResult]: Stem: 6688#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 6694#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6713#L14 assume !(0 == main_~i~0#1); 6741#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6740#L17-1 assume !(1 == main_~up~0#1); 6739#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6736#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6737#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6866#L14 assume !(0 == main_~i~0#1); 6865#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6864#L17-1 assume !(1 == main_~up~0#1); 6863#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6862#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6861#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6860#L14 assume !(0 == main_~i~0#1); 6859#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6858#L17-1 assume !(1 == main_~up~0#1); 6857#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6856#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6855#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6854#L14 assume !(0 == main_~i~0#1); 6853#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6852#L17-1 assume !(1 == main_~up~0#1); 6851#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6850#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6849#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6848#L14 assume !(0 == main_~i~0#1); 6847#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6846#L17-1 assume !(1 == main_~up~0#1); 6845#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6844#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6843#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6842#L14 assume !(0 == main_~i~0#1); 6841#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6840#L17-1 assume !(1 == main_~up~0#1); 6839#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6838#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6837#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6836#L14 assume !(0 == main_~i~0#1); 6835#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6834#L17-1 assume !(1 == main_~up~0#1); 6833#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6832#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6831#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6830#L14 assume !(0 == main_~i~0#1); 6829#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6828#L17-1 assume !(1 == main_~up~0#1); 6827#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6826#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6825#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6824#L14 assume !(0 == main_~i~0#1); 6823#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6822#L17-1 assume !(1 == main_~up~0#1); 6821#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6820#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6819#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6818#L14 assume !(0 == main_~i~0#1); 6817#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6816#L17-1 assume !(1 == main_~up~0#1); 6815#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6814#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6813#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6812#L14 assume !(0 == main_~i~0#1); 6811#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6810#L17-1 assume !(1 == main_~up~0#1); 6809#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6808#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6807#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6806#L14 assume !(0 == main_~i~0#1); 6805#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6804#L17-1 assume !(1 == main_~up~0#1); 6803#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6802#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6801#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6800#L14 assume !(0 == main_~i~0#1); 6799#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6798#L17-1 assume !(1 == main_~up~0#1); 6797#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6796#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6795#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6794#L14 assume !(0 == main_~i~0#1); 6793#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6792#L17-1 assume !(1 == main_~up~0#1); 6791#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6790#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6789#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6788#L14 assume !(0 == main_~i~0#1); 6787#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6786#L17-1 assume !(1 == main_~up~0#1); 6785#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6784#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6783#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6782#L14 assume !(0 == main_~i~0#1); 6781#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6780#L17-1 assume !(1 == main_~up~0#1); 6779#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6778#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6777#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6776#L14 assume !(0 == main_~i~0#1); 6775#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6774#L17-1 assume !(1 == main_~up~0#1); 6773#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6772#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6771#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6770#L14 assume !(0 == main_~i~0#1); 6769#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6768#L17-1 assume !(1 == main_~up~0#1); 6767#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6766#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6732#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6747#L14 assume !(0 == main_~i~0#1); 6745#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6743#L17-1 assume !(1 == main_~up~0#1); 6734#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6731#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6728#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6710#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6707#L14-2 [2023-02-17 09:43:13,304 INFO L750 eck$LassoCheckResult]: Loop: 6707#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6704#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6705#L20-1 assume !(0 == main_~up~0#1); 6715#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6714#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6712#L14 assume !(0 == main_~i~0#1); 6708#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6706#L17-1 assume !(1 == main_~up~0#1); 6690#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6691#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6698#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6709#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6707#L14-2 [2023-02-17 09:43:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2023-02-17 09:43:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551947098] [2023-02-17 09:43:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2023-02-17 09:43:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950903500] [2023-02-17 09:43:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 2 times [2023-02-17 09:43:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:13,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513715401] [2023-02-17 09:43:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:13,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 09:43:13 BoogieIcfgContainer [2023-02-17 09:43:13,561 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-17 09:43:13,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:43:13,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:43:13,562 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:43:13,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:06" (3/4) ... [2023-02-17 09:43:13,565 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-17 09:43:13,656 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:43:13,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:43:13,657 INFO L158 Benchmark]: Toolchain (without parser) took 7226.69ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 112.0MB in the beginning and 123.7MB in the end (delta: -11.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-02-17 09:43:13,657 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:13,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.75ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 102.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 09:43:13,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.36ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:43:13,658 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.8MB in the end (delta: 871.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:13,659 INFO L158 Benchmark]: RCFGBuilder took 268.64ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 91.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 09:43:13,659 INFO L158 Benchmark]: BuchiAutomizer took 6655.39ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 91.0MB in the beginning and 128.9MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:13,659 INFO L158 Benchmark]: Witness Printer took 95.15ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 123.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 09:43:13,661 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.75ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 102.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.36ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.8MB in the end (delta: 871.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.64ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 91.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6655.39ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 91.0MB in the beginning and 128.9MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 95.15ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 123.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 15 terminating modules (11 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function range + -1 * i and consists of 4 locations. One deterministic module has affine ranking function range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. The remainder module has 315 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 14 iterations. TraceHistogramMax:20. Analysis of lassos took 4.5s. Construction of modules took 0.6s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 269 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 562 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 196 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax134 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp100 dnf146 smp100 tf102 neg92 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-17 09:43:13,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:13,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-02-17 09:43:14,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:14,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:14,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:14,732 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)