./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 3dbbec33 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-?-3dbbec3 [2023-02-14 14:44:09,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:44:09,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:44:09,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:44:09,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:44:09,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:44:09,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:44:09,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:44:09,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:44:09,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:44:09,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:44:09,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:44:09,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:44:09,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:44:09,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:44:09,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:44:09,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:44:09,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:44:09,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:44:09,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:44:09,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:44:09,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:44:09,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:44:09,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:44:09,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:44:09,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:44:09,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:44:09,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:44:09,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:44:09,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:44:09,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:44:09,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:44:09,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:44:09,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:44:09,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:44:09,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:44:09,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:44:09,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:44:09,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:44:09,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:44:09,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:44:09,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 14:44:09,837 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:44:09,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:44:09,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:44:09,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:44:09,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:44:09,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:44:09,839 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:44:09,840 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 14:44:09,840 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 14:44:09,840 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 14:44:09,840 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 14:44:09,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:44:09,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:44:09,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 14:44:09,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:44:09,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:44:09,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:44:09,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 14:44:09,844 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 14:44:09,845 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-14 14:44:10,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:44:10,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:44:10,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:44:10,026 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:44:10,026 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:44:10,027 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-14 14:44:10,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:44:11,091 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:44:11,092 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-14 14:44:11,096 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47acc1d73/649402e4b00e400287206ae606a074a9/FLAGd99768e00 [2023-02-14 14:44:11,110 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47acc1d73/649402e4b00e400287206ae606a074a9 [2023-02-14 14:44:11,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:44:11,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:44:11,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:44:11,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:44:11,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:44:11,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ac17e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11, skipping insertion in model container [2023-02-14 14:44:11,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:44:11,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:44:11,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:44:11,252 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:44:11,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:44:11,272 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:44:11,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11 WrapperNode [2023-02-14 14:44:11,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:44:11,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:44:11,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:44:11,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:44:11,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,292 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-14 14:44:11,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:44:11,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:44:11,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:44:11,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:44:11,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:44:11,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:44:11,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:44:11,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:44:11,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (1/1) ... [2023-02-14 14:44:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:11,337 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-14 14:44:11,345 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-14 14:44:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:44:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:44:11,408 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:44:11,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:44:11,469 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:44:11,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:44:11,473 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 14:44:11,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:44:11 BoogieIcfgContainer [2023-02-14 14:44:11,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:44:11,475 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 14:44:11,475 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 14:44:11,478 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 14:44:11,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:44:11,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 02:44:11" (1/3) ... [2023-02-14 14:44:11,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41ae5434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:44:11, skipping insertion in model container [2023-02-14 14:44:11,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:44:11,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:44:11" (2/3) ... [2023-02-14 14:44:11,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41ae5434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:44:11, skipping insertion in model container [2023-02-14 14:44:11,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:44:11,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:44:11" (3/3) ... [2023-02-14 14:44:11,481 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2023-02-14 14:44:11,515 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 14:44:11,515 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 14:44:11,515 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 14:44:11,515 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 14:44:11,516 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 14:44:11,516 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 14:44:11,516 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 14:44:11,516 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 14:44:11,520 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-14 14:44:11,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-14 14:44:11,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:11,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:11,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 14:44:11,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:11,536 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 14:44:11,536 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-14 14:44:11,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-14 14:44:11,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:11,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:11,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 14:44:11,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:11,544 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-14 14:44:11,545 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-14 14:44:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-14 14:44:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:11,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356973329] [2023-02-14 14:44:11,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:11,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:11,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2023-02-14 14:44:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:11,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899868066] [2023-02-14 14:44:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:11,773 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-14 14:44:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:11,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899868066] [2023-02-14 14:44:11,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899868066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:44:11,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:44:11,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:44:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890245567] [2023-02-14 14:44:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:44:11,779 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:44:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:44:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:44:11,807 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-14 14:44:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:11,852 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2023-02-14 14:44:11,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2023-02-14 14:44:11,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-14 14:44:11,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2023-02-14 14:44:11,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-14 14:44:11,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-14 14:44:11,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-02-14 14:44:11,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:44:11,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-14 14:44:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-02-14 14:44:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-14 14:44:11,890 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-14 14:44:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-02-14 14:44:11,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-14 14:44:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:44:11,895 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-14 14:44:11,896 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 14:44:11,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-02-14 14:44:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-14 14:44:11,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:11,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:11,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 14:44:11,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:11,898 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-14 14:44:11,898 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-14 14:44:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-14 14:44:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:11,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233017613] [2023-02-14 14:44:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:11,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:11,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2023-02-14 14:44:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:11,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818211676] [2023-02-14 14:44:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:11,940 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-14 14:44:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818211676] [2023-02-14 14:44:11,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818211676] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:44:11,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:44:11,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:44:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208856309] [2023-02-14 14:44:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:44:11,942 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:44:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:11,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:44:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 14:44:11,943 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-14 14:44:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:11,974 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-02-14 14:44:11,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2023-02-14 14:44:11,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-14 14:44:11,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2023-02-14 14:44:11,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-14 14:44:11,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-14 14:44:11,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2023-02-14 14:44:11,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:44:11,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-14 14:44:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2023-02-14 14:44:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-14 14:44:11,981 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-14 14:44:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-02-14 14:44:11,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-14 14:44:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:44:11,983 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-14 14:44:11,983 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 14:44:11,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2023-02-14 14:44:11,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-14 14:44:11,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:11,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:11,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 14:44:11,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:11,989 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-14 14:44:11,989 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-14 14:44:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-14 14:44:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:11,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791623800] [2023-02-14 14:44:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2023-02-14 14:44:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707962101] [2023-02-14 14:44:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44: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-14 14:44:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707962101] [2023-02-14 14:44:12,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707962101] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:44:12,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:44:12,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:44:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279077774] [2023-02-14 14:44:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:44:12,032 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:44:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:44:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:44:12,033 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-14 14:44:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:12,043 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2023-02-14 14:44:12,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2023-02-14 14:44:12,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-14 14:44:12,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2023-02-14 14:44:12,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-14 14:44:12,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-14 14:44:12,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2023-02-14 14:44:12,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:44:12,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-02-14 14:44:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2023-02-14 14:44:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-14 14:44:12,048 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-14 14:44:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-14 14:44:12,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-14 14:44:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:44:12,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-14 14:44:12,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 14:44:12,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-14 14:44:12,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-14 14:44:12,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:12,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:12,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 14:44:12,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:12,051 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-14 14:44:12,051 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-14 14:44:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-02-14 14:44:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801088741] [2023-02-14 14:44:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2023-02-14 14:44:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706725611] [2023-02-14 14:44:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2023-02-14 14:44:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158711106] [2023-02-14 14:44:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,194 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:12,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:12,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:12,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:12,196 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:44:12,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:12,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:12,198 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-14 14:44:12,198 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:12,198 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:12,213 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-14 14:44:12,223 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-14 14:44:12,226 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-14 14:44:12,236 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-14 14:44:12,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:12,299 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:44:12,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,302 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-14 14:44:12,303 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-14 14:44:12,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:12,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:12,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:44:12,328 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-14 14:44:12,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,377 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-14 14:44:12,379 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-14 14:44:12,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:12,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:12,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:44:12,408 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-14 14:44:12,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-14 14:44:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,413 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-14 14:44:12,414 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-14 14:44:12,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:12,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:12,440 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-14 14:44:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,441 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-14 14:44:12,443 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-14 14:44:12,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:44:12,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:12,463 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:44:12,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-14 14:44:12,468 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:12,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:12,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:12,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:12,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:44:12,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:12,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:12,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-14 14:44:12,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:12,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:12,469 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-14 14:44:12,473 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-14 14:44:12,485 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-14 14:44:12,488 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-14 14:44:12,538 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:12,541 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:44:12,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,543 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-14 14:44:12,545 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-14 14:44:12,546 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-14 14:44:12,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:12,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:12,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:44:12,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:12,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:44:12,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:44:12,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:44:12,575 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-14 14:44:12,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,577 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-14 14:44:12,578 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-14 14:44:12,579 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-14 14:44:12,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:12,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:44:12,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:12,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:44:12,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:12,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:44:12,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:44:12,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:44:12,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:44:12,625 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:44:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:12,627 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-14 14:44:12,629 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-14 14:44:12,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:44:12,630 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:44:12,631 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:44:12,631 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-14 14:44:12,636 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-14 14:44:12,638 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:44:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:12,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:44:12,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:12,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 14:44:12,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:12,724 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-14 14:44:12,727 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-14 14:44:12,728 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-14 14:44:12,778 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-14 14:44:12,779 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-14 14:44:12,780 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-14 14:44:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 14:44:12,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-14 14:44:12,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:12,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2023-02-14 14:44:12,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:12,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2023-02-14 14:44:12,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:12,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2023-02-14 14:44:12,794 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2023-02-14 14:44:12,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2023-02-14 14:44:12,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-02-14 14:44:12,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-02-14 14:44:12,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2023-02-14 14:44:12,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:12,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-02-14 14:44:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2023-02-14 14:44:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-02-14 14:44:12,803 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-14 14:44:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2023-02-14 14:44:12,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-14 14:44:12,804 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-14 14:44:12,804 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 14:44:12,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2023-02-14 14:44:12,805 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2023-02-14 14:44:12,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:12,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:12,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-14 14:44:12,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:12,806 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-14 14:44:12,806 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-14 14:44:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-14 14:44:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689052350] [2023-02-14 14:44:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2023-02-14 14:44:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409988898] [2023-02-14 14:44:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2023-02-14 14:44:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528870965] [2023-02-14 14:44:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:12,830 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-14 14:44:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528870965] [2023-02-14 14:44:12,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528870965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:44:12,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:44:12,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:44:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667510641] [2023-02-14 14:44:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:44:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:44:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:44:12,859 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-14 14:44:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:12,867 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-02-14 14:44:12,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2023-02-14 14:44:12,868 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-14 14:44:12,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2023-02-14 14:44:12,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-14 14:44:12,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-14 14:44:12,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2023-02-14 14:44:12,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:12,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2023-02-14 14:44:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2023-02-14 14:44:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-02-14 14:44:12,874 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-14 14:44:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2023-02-14 14:44:12,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-14 14:44:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:44:12,875 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-14 14:44:12,876 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 14:44:12,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2023-02-14 14:44:12,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-14 14:44:12,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:12,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:12,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:44:12,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:12,877 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-14 14:44:12,877 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-14 14:44:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-14 14:44:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163695097] [2023-02-14 14:44:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2023-02-14 14:44:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547231995] [2023-02-14 14:44:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2023-02-14 14:44:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80404022] [2023-02-14 14:44:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:12,905 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-14 14:44:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:12,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80404022] [2023-02-14 14:44:12,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80404022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:44:12,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:44:12,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:44:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124307056] [2023-02-14 14:44:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:44:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:44:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:44:12,936 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-14 14:44:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:12,944 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-02-14 14:44:12,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2023-02-14 14:44:12,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-14 14:44:12,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2023-02-14 14:44:12,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-14 14:44:12,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-14 14:44:12,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2023-02-14 14:44:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:12,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-02-14 14:44:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2023-02-14 14:44:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2023-02-14 14:44:12,954 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-14 14:44:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-02-14 14:44:12,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-14 14:44:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:44:12,956 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-14 14:44:12,956 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 14:44:12,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2023-02-14 14:44:12,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-14 14:44:12,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:12,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:12,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:44:12,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:12,958 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-14 14:44:12,958 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-14 14:44:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-14 14:44:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118979540] [2023-02-14 14:44:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2023-02-14 14:44:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158572719] [2023-02-14 14:44:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2023-02-14 14:44:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145223172] [2023-02-14 14:44:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:12,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:13,035 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:13,035 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:13,035 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:13,035 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:13,035 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:44:13,035 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,035 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:13,035 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:13,035 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-14 14:44:13,035 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:13,035 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:13,036 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-14 14:44:13,039 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-14 14:44:13,041 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-14 14:44:13,043 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-14 14:44:13,140 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:13,140 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:44:13,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,141 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-14 14:44:13,144 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-14 14:44:13,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:13,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:13,167 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:44:13,167 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-14 14:44:13,170 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-14 14:44:13,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,171 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-14 14:44:13,184 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-14 14:44:13,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-14 14:44:13,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:13,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:13,207 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:44:13,207 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-14 14:44:13,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:13,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,211 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-14 14:44:13,213 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-14 14:44:13,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:13,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:13,235 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:44:13,236 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-14 14:44:13,238 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-14 14:44:13,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,240 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-14 14:44:13,242 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-14 14:44:13,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:13,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:13,269 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-14 14:44:13,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,270 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-14 14:44:13,272 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-14 14:44:13,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:44:13,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:13,436 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:44:13,440 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-14 14:44:13,440 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:13,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:13,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:13,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:13,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:44:13,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:13,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:13,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-14 14:44:13,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:13,441 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:13,443 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-14 14:44:13,445 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-14 14:44:13,453 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-14 14:44:13,455 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-14 14:44:13,532 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:13,532 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:44:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,533 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-14 14:44:13,537 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-14 14:44:13,538 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-14 14:44:13,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:13,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:13,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:44:13,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:13,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:44:13,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:44:13,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:44:13,564 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-14 14:44:13,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,566 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-14 14:44:13,568 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-14 14:44:13,570 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-14 14:44:13,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:13,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:13,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:44:13,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:13,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:44:13,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:44:13,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:44:13,593 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-14 14:44:13,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,594 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-14 14:44:13,595 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-14 14:44:13,600 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-14 14:44:13,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:13,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:44:13,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:13,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:44:13,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:13,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:44:13,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:44:13,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:44:13,615 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-14 14:44:13,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,616 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-14 14:44:13,618 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-14 14:44:13,619 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-14 14:44:13,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:13,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:44:13,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:13,626 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-14 14:44:13,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:13,627 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:44:13,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:44:13,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:44:13,645 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 14:44:13,645 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:44:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,646 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-14 14:44:13,648 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-14 14:44:13,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:44:13,649 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:44:13,649 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:44:13,649 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-14 14:44:13,654 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-14 14:44:13,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:44:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:13,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:44:13,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:13,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 14:44:13,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:13,723 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-14 14:44:13,723 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-14 14:44:13,724 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-14 14:44:13,756 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-14 14:44:13,758 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-14 14:44:13,758 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-14 14:44:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-14 14:44:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2023-02-14 14:44:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 14:44:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2023-02-14 14:44:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:13,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2023-02-14 14:44:13,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-14 14:44:13,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2023-02-14 14:44:13,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-14 14:44:13,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-14 14:44:13,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2023-02-14 14:44:13,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:13,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-02-14 14:44:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2023-02-14 14:44:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-02-14 14:44:13,770 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-14 14:44:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2023-02-14 14:44:13,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-14 14:44:13,770 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-14 14:44:13,771 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-14 14:44:13,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2023-02-14 14:44:13,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-14 14:44:13,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:13,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:13,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:44:13,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:44:13,773 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-14 14:44:13,773 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-14 14:44:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2023-02-14 14:44:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:13,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669538266] [2023-02-14 14:44:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:13,807 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-14 14:44:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669538266] [2023-02-14 14:44:13,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669538266] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:44:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696771365] [2023-02-14 14:44:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:44:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,810 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-14 14:44:13,812 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-14 14:44:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:13,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 14:44:13,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:13,844 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-14 14:44:13,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:44:13,861 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-14 14:44:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696771365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:44:13,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:44:13,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-14 14:44:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812460974] [2023-02-14 14:44:13,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:44:13,862 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:44:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2023-02-14 14:44:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:13,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158240194] [2023-02-14 14:44:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:13,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:13,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:13,898 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:13,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:13,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:13,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:13,898 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:44:13,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:13,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:13,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-14 14:44:13,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:13,898 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:13,899 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-14 14:44:13,912 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-14 14:44:13,914 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-14 14:44:13,915 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-14 14:44:13,995 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:13,996 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:44:13,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:13,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:13,998 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-14 14:44:14,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:44:14,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:14,004 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-14 14:44:14,025 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-14 14:44:14,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:14,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:14,026 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-14 14:44:14,028 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-14 14:44:14,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:44:14,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:44:14,189 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:44:14,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:14,193 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:14,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:14,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:14,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:14,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:44:14,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:14,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:14,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:14,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-14 14:44:14,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:14,193 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:14,194 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-14 14:44:14,208 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-14 14:44:14,211 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-14 14:44:14,212 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-14 14:44:14,283 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:44:14,283 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:44:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:14,285 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-14 14:44:14,289 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-14 14:44:14,289 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-14 14:44:14,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:44:14,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:44:14,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:44:14,296 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-14 14:44:14,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:44:14,298 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:44:14,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:44:14,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:44:14,326 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 14:44:14,326 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:44:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:14,330 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-14 14:44:14,331 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-14 14:44:14,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:44:14,333 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:44:14,333 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:44:14,333 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-14 14:44:14,338 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-14 14:44:14,339 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:44:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,393 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-14 14:44:14,403 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-14 14:44:14,403 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-14 14:44:14,404 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-14 14:44:14,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:14,434 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-14 14:44:14,434 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-14 14:44:14,435 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-14 14:44:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-14 14:44:14,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 14:44:14,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:14,435 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:44:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,491 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-14 14:44:14,491 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-14 14:44:14,491 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-14 14:44:14,529 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-14 14:44:14,529 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-14 14:44:14,530 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-14 14:44:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-02-14 14:44:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 14:44:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:14,531 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:44:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,583 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-14 14:44:14,583 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-14 14:44:14,583 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-14 14:44:14,603 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-14 14:44:14,604 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-14 14:44:14,605 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-14 14:44:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-02-14 14:44:14,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 14:44:14,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:14,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-14 14:44:14,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:14,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2023-02-14 14:44:14,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:44:14,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2023-02-14 14:44:14,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-14 14:44:14,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2023-02-14 14:44:14,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-14 14:44:14,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-02-14 14:44:14,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2023-02-14 14:44:14,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:14,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2023-02-14 14:44:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2023-02-14 14:44:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-02-14 14:44:14,609 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-14 14:44:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-02-14 14:44:14,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-02-14 14:44:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 14:44:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 14:44:14,610 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-14 14:44:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:14,672 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2023-02-14 14:44:14,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2023-02-14 14:44:14,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2023-02-14 14:44:14,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2023-02-14 14:44:14,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-02-14 14:44:14,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-02-14 14:44:14,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2023-02-14 14:44:14,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:14,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2023-02-14 14:44:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2023-02-14 14:44:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2023-02-14 14:44:14,678 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-14 14:44:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2023-02-14 14:44:14,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-14 14:44:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 14:44:14,682 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-14 14:44:14,682 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-14 14:44:14,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2023-02-14 14:44:14,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2023-02-14 14:44:14,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:14,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:14,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:44:14,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-14 14:44:14,684 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-14 14:44:14,684 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-14 14:44:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2023-02-14 14:44:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:14,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375559491] [2023-02-14 14:44:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:14,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:14,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2023-02-14 14:44:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:14,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847221707] [2023-02-14 14:44:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,784 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-14 14:44:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847221707] [2023-02-14 14:44:14,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847221707] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:44:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908982182] [2023-02-14 14:44:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:44:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:14,786 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-14 14:44:14,787 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-14 14:44:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:14,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:44:14,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:14,852 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-14 14:44:14,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:44:14,880 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-14 14:44:14,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908982182] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:44:14,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:44:14,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-02-14 14:44:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960210888] [2023-02-14 14:44:14,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:44:14,881 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:44:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 14:44:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-14 14:44:14,882 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-14 14:44:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:15,011 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-02-14 14:44:15,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2023-02-14 14:44:15,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-14 14:44:15,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2023-02-14 14:44:15,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-14 14:44:15,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-02-14 14:44:15,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2023-02-14 14:44:15,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:15,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-02-14 14:44:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2023-02-14 14:44:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-14 14:44:15,014 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-14 14:44:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-02-14 14:44:15,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-14 14:44:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 14:44:15,015 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-14 14:44:15,015 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-14 14:44:15,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2023-02-14 14:44:15,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:15,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:15,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:15,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2023-02-14 14:44:15,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:44:15,016 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-14 14:44:15,016 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-14 14:44:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2023-02-14 14:44:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724919468] [2023-02-14 14:44:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:15,055 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-14 14:44:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:15,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724919468] [2023-02-14 14:44:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724919468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:44:15,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374809493] [2023-02-14 14:44:15,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:44:15,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:44:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:15,065 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-14 14:44:15,067 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-14 14:44:15,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:44:15,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:44:15,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 14:44:15,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:15,113 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-14 14:44:15,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:44:15,157 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-14 14:44:15,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374809493] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:44:15,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:44:15,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-02-14 14:44:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496028052] [2023-02-14 14:44:15,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:44:15,158 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:44:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2023-02-14 14:44:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:15,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421934087] [2023-02-14 14:44:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:15,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:15,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 14:44:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-14 14:44:15,206 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-14 14:44:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:15,326 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2023-02-14 14:44:15,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2023-02-14 14:44:15,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:15,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2023-02-14 14:44:15,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2023-02-14 14:44:15,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2023-02-14 14:44:15,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2023-02-14 14:44:15,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:15,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2023-02-14 14:44:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2023-02-14 14:44:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2023-02-14 14:44:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 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-14 14:44:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-02-14 14:44:15,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-02-14 14:44:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 14:44:15,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-02-14 14:44:15,334 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-14 14:44:15,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2023-02-14 14:44:15,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:15,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:15,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:15,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2023-02-14 14:44:15,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:44:15,337 INFO L748 eck$LassoCheckResult]: Stem: 2606#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2607#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; 2618#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2641#L14 assume !(0 == main_~i~0#1); 2638#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2635#L17-1 assume !(1 == main_~up~0#1); 2632#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2627#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2626#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2728#L14 assume !(0 == main_~i~0#1); 2623#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2614#L17-1 assume !(1 == main_~up~0#1); 2615#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2624#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2725#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2724#L14 assume !(0 == main_~i~0#1); 2723#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2722#L17-1 assume !(1 == main_~up~0#1); 2721#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2720#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2719#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2718#L14 assume !(0 == main_~i~0#1); 2717#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2716#L17-1 assume !(1 == main_~up~0#1); 2715#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2714#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2713#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2712#L14 assume !(0 == main_~i~0#1); 2711#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2710#L17-1 assume !(1 == main_~up~0#1); 2709#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2708#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2707#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2706#L14 assume !(0 == main_~i~0#1); 2705#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2704#L17-1 assume !(1 == main_~up~0#1); 2703#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2702#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2658#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2699#L14 assume !(0 == main_~i~0#1); 2671#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2669#L17-1 assume !(1 == main_~up~0#1); 2661#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2656#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2657#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2651#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2652#L14-2 [2023-02-14 14:44:15,337 INFO L750 eck$LassoCheckResult]: Loop: 2652#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2613#L20-1 assume !(0 == main_~up~0#1); 2667#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2666#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2665#L14 assume !(0 == main_~i~0#1); 2664#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2663#L17-1 assume !(1 == main_~up~0#1); 2662#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2659#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2653#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2654#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2652#L14-2 [2023-02-14 14:44:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2023-02-14 14:44:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538025489] [2023-02-14 14:44:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538025489] [2023-02-14 14:44:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538025489] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:44:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610454773] [2023-02-14 14:44:15,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:44:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:44:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:15,438 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-14 14:44:15,440 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-14 14:44:15,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-14 14:44:15,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:44:15,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 14:44:15,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:15,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:44:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:15,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610454773] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:44:15,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:44:15,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-02-14 14:44:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31958098] [2023-02-14 14:44:15,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:44:15,627 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:44:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2023-02-14 14:44:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:15,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686280413] [2023-02-14 14:44:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:15,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:15,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 14:44:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2023-02-14 14:44:15,669 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 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-14 14:44:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:15,858 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2023-02-14 14:44:15,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2023-02-14 14:44:15,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:15,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2023-02-14 14:44:15,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-02-14 14:44:15,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-14 14:44:15,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2023-02-14 14:44:15,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:15,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2023-02-14 14:44:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2023-02-14 14:44:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2023-02-14 14:44:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0515021459227467) internal successors, (245), 232 states have internal predecessors, (245), 0 states have call successors, (0), 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-14 14:44:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2023-02-14 14:44:15,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-02-14 14:44:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 14:44:15,865 INFO L428 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-02-14 14:44:15,865 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-14 14:44:15,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2023-02-14 14:44:15,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:15,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:15,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:15,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2023-02-14 14:44:15,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:44:15,870 INFO L748 eck$LassoCheckResult]: Stem: 3324#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3325#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; 3337#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3361#L14 assume !(0 == main_~i~0#1); 3357#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3353#L17-1 assume !(1 == main_~up~0#1); 3350#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3345#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3322#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3323#L14 assume !(0 == main_~i~0#1); 3340#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3333#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3343#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3542#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3541#L14 assume !(0 == main_~i~0#1); 3540#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3539#L17-1 assume !(1 == main_~up~0#1); 3538#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3537#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3536#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3535#L14 assume !(0 == main_~i~0#1); 3534#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3533#L17-1 assume !(1 == main_~up~0#1); 3532#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3531#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3530#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3529#L14 assume !(0 == main_~i~0#1); 3528#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3527#L17-1 assume !(1 == main_~up~0#1); 3526#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3525#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3524#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3523#L14 assume !(0 == main_~i~0#1); 3522#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3521#L17-1 assume !(1 == main_~up~0#1); 3520#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3519#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3518#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3517#L14 assume !(0 == main_~i~0#1); 3516#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3515#L17-1 assume !(1 == main_~up~0#1); 3514#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3513#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3512#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3511#L14 assume !(0 == main_~i~0#1); 3510#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3509#L17-1 assume !(1 == main_~up~0#1); 3508#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3507#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3506#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3505#L14 assume !(0 == main_~i~0#1); 3504#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3503#L17-1 assume !(1 == main_~up~0#1); 3502#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3501#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3500#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3499#L14 assume !(0 == main_~i~0#1); 3498#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3497#L17-1 assume !(1 == main_~up~0#1); 3496#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3495#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3494#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3493#L14 assume !(0 == main_~i~0#1); 3492#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3491#L17-1 assume !(1 == main_~up~0#1); 3490#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3489#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3488#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3487#L14 assume !(0 == main_~i~0#1); 3486#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3485#L17-1 assume !(1 == main_~up~0#1); 3484#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3483#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); 3481#L14 assume !(0 == main_~i~0#1); 3480#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3479#L17-1 assume !(1 == main_~up~0#1); 3478#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3477#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3476#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3475#L14 assume !(0 == main_~i~0#1); 3474#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3473#L17-1 assume !(1 == main_~up~0#1); 3472#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3471#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3377#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3468#L14 assume !(0 == main_~i~0#1); 3392#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3388#L17-1 assume !(1 == main_~up~0#1); 3380#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3375#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3370#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3371#L14-2 [2023-02-14 14:44:15,870 INFO L750 eck$LassoCheckResult]: Loop: 3371#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3330#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3331#L20-1 assume !(0 == main_~up~0#1); 3386#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3385#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3384#L14 assume !(0 == main_~i~0#1); 3383#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3382#L17-1 assume !(1 == main_~up~0#1); 3381#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3378#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3373#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3371#L14-2 [2023-02-14 14:44:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2023-02-14 14:44:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796022964] [2023-02-14 14:44:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:44:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:44:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796022964] [2023-02-14 14:44:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796022964] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:44:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715398094] [2023-02-14 14:44:16,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 14:44:16,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:44:16,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:44:16,133 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:44:16,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-14 14:44:16,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 14:44:16,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:44:16,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 14:44:16,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:44:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:16,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:44:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:44:16,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715398094] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:44:16,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:44:16,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2023-02-14 14:44:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174507091] [2023-02-14 14:44:16,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:44:16,444 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:44:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2023-02-14 14:44:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921704258] [2023-02-14 14:44:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:44:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 14:44:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2023-02-14 14:44:16,482 INFO L87 Difference]: Start difference. First operand 233 states and 245 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 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-14 14:44:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:44:16,627 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2023-02-14 14:44:16,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2023-02-14 14:44:16,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:16,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2023-02-14 14:44:16,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-02-14 14:44:16,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-02-14 14:44:16,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2023-02-14 14:44:16,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:44:16,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2023-02-14 14:44:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2023-02-14 14:44:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2023-02-14 14:44:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 1.0427046263345197) internal successors, (293), 280 states have internal predecessors, (293), 0 states have call successors, (0), 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-14 14:44:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2023-02-14 14:44:16,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-02-14 14:44:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 14:44:16,633 INFO L428 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-02-14 14:44:16,633 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-14 14:44:16,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2023-02-14 14:44:16,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-14 14:44:16,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:44:16,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:44:16,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2023-02-14 14:44:16,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:44:16,636 INFO L748 eck$LassoCheckResult]: Stem: 4462#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4463#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; 4468#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4488#L14 assume !(0 == main_~i~0#1); 4486#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4485#L17-1 assume !(1 == main_~up~0#1); 4484#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4481#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4480#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4476#L14 assume !(0 == main_~i~0#1); 4477#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4471#L17-1 assume !(1 == main_~up~0#1); 4472#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4478#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4623#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4622#L14 assume !(0 == main_~i~0#1); 4621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4620#L17-1 assume !(1 == main_~up~0#1); 4619#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4618#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4617#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4616#L14 assume !(0 == main_~i~0#1); 4615#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4614#L17-1 assume !(1 == main_~up~0#1); 4613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4612#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4611#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4610#L14 assume !(0 == main_~i~0#1); 4609#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4608#L17-1 assume !(1 == main_~up~0#1); 4607#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4606#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4605#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4604#L14 assume !(0 == main_~i~0#1); 4603#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4602#L17-1 assume !(1 == main_~up~0#1); 4601#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4600#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4599#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4598#L14 assume !(0 == main_~i~0#1); 4597#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4596#L17-1 assume !(1 == main_~up~0#1); 4595#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4594#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4593#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4592#L14 assume !(0 == main_~i~0#1); 4591#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4590#L17-1 assume !(1 == main_~up~0#1); 4589#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4588#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4587#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4586#L14 assume !(0 == main_~i~0#1); 4585#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4584#L17-1 assume !(1 == main_~up~0#1); 4583#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4582#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4581#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4580#L14 assume !(0 == main_~i~0#1); 4579#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4578#L17-1 assume !(1 == main_~up~0#1); 4577#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4576#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4575#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4574#L14 assume !(0 == main_~i~0#1); 4573#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4572#L17-1 assume !(1 == main_~up~0#1); 4571#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4570#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4569#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4568#L14 assume !(0 == main_~i~0#1); 4567#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4566#L17-1 assume !(1 == main_~up~0#1); 4565#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4564#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4563#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4562#L14 assume !(0 == main_~i~0#1); 4561#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4560#L17-1 assume !(1 == main_~up~0#1); 4559#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4558#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4557#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4556#L14 assume !(0 == main_~i~0#1); 4555#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4554#L17-1 assume !(1 == main_~up~0#1); 4553#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4552#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4551#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4550#L14 assume !(0 == main_~i~0#1); 4549#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4548#L17-1 assume !(1 == main_~up~0#1); 4547#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4546#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4545#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4544#L14 assume !(0 == main_~i~0#1); 4543#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4542#L17-1 assume !(1 == main_~up~0#1); 4541#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4540#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4539#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4538#L14 assume !(0 == main_~i~0#1); 4537#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4536#L17-1 assume !(1 == main_~up~0#1); 4535#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4534#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4533#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4532#L14 assume !(0 == main_~i~0#1); 4531#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4530#L17-1 assume !(1 == main_~up~0#1); 4529#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4528#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4504#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume !(0 == main_~i~0#1); 4511#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4508#L17-1 assume !(1 == main_~up~0#1); 4505#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4502#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4503#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4514#L14-2 [2023-02-14 14:44:16,636 INFO L750 eck$LassoCheckResult]: Loop: 4514#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4507#L20-1 assume !(0 == main_~up~0#1); 4526#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4525#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4524#L14 assume !(0 == main_~i~0#1); 4523#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4522#L17-1 assume !(1 == main_~up~0#1); 4521#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4519#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4516#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4517#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4514#L14-2 [2023-02-14 14:44:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2023-02-14 14:44:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802928841] [2023-02-14 14:44:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2023-02-14 14:44:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:16,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084803907] [2023-02-14 14:44:16,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:44:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2023-02-14 14:44:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:44:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070923075] [2023-02-14 14:44:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:44:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:44:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:16,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:44:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:17,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:44:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:44:17,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.02 02:44:17 BoogieIcfgContainer [2023-02-14 14:44:17,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-14 14:44:17,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 14:44:17,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 14:44:17,564 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 14:44:17,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:44:11" (3/4) ... [2023-02-14 14:44:17,566 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-14 14:44:17,636 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 14:44:17,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 14:44:17,639 INFO L158 Benchmark]: Toolchain (without parser) took 6525.83ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 106.5MB in the beginning and 89.7MB in the end (delta: 16.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2023-02-14 14:44:17,639 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:44:17,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.87ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 97.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 14:44:17,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.18ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:44:17,639 INFO L158 Benchmark]: Boogie Preprocessor took 16.03ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:44:17,640 INFO L158 Benchmark]: RCFGBuilder took 163.96ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 85.6MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 14:44:17,640 INFO L158 Benchmark]: BuchiAutomizer took 6087.92ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 85.6MB in the beginning and 94.9MB in the end (delta: -9.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-02-14 14:44:17,640 INFO L158 Benchmark]: Witness Printer took 74.98ms. Allocated memory is still 172.0MB. Free memory was 94.9MB in the beginning and 89.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-14 14:44:17,641 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.14ms. Allocated memory is still 113.2MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.87ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 97.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.18ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.03ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 163.96ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 85.6MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6087.92ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 85.6MB in the beginning and 94.9MB in the end (delta: -9.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 74.98ms. Allocated memory is still 172.0MB. Free memory was 94.9MB in the beginning and 89.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 13 terminating modules (10 trivial, 2 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 -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 4.5s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 11 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 169 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp62 dnf141 smp94 tf105 neg90 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 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-14 14:44:17,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:17,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-14 14:44:18,086 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-14 14:44:18,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-02-14 14:44:18,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-14 14:44:18,690 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)