./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 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-restricted-15/Narrowing.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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.3.0-?-4f9af40
[2024-11-07 23:48:41,057 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 23:48:41,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-07 23:48:41,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 23:48:41,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 23:48:41,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 23:48:41,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 23:48:41,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 23:48:41,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 23:48:41,178 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 23:48:41,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 23:48:41,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 23:48:41,179 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 23:48:41,179 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-07 23:48:41,180 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-07 23:48:41,180 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-07 23:48:41,180 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-07 23:48:41,181 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-07 23:48:41,181 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-07 23:48:41,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 23:48:41,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 23:48:41,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 23:48:41,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 23:48:41,183 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-07 23:48:41,183 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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
[2024-11-07 23:48:41,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 23:48:41,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 23:48:41,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 23:48:41,521 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 23:48:41,521 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 23:48:41,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c
[2024-11-07 23:48:42,824 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 23:48:43,031 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 23:48:43,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c
[2024-11-07 23:48:43,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7437a0fae/bf79fb99493640af9720a8eec67289d8/FLAG8f03e79ec
[2024-11-07 23:48:43,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7437a0fae/bf79fb99493640af9720a8eec67289d8
[2024-11-07 23:48:43,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 23:48:43,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 23:48:43,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 23:48:43,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 23:48:43,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 23:48:43,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f791b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43, skipping insertion in model container
[2024-11-07 23:48:43,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,411 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 23:48:43,526 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:48:43,530 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 23:48:43,540 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:48:43,549 INFO L204 MainTranslator]: Completed translation
[2024-11-07 23:48:43,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43 WrapperNode
[2024-11-07 23:48:43,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 23:48:43,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 23:48:43,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 23:48:43,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 23:48:43,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,571 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26
[2024-11-07 23:48:43,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 23:48:43,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 23:48:43,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 23:48:43,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 23:48:43,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,584 INFO L175 MemorySlicer]: No memory access in input program.
[2024-11-07 23:48:43,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 23:48:43,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 23:48:43,601 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 23:48:43,601 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 23:48:43,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (1/1) ...
[2024-11-07 23:48:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:43,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:43,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-07 23:48:43,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 23:48:43,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 23:48:43,729 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 23:48:43,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 23:48:43,814 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live.
[2024-11-07 23:48:43,815 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 23:48:43,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 23:48:43,824 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 23:48:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:48:43 BoogieIcfgContainer
[2024-11-07 23:48:43,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 23:48:43,826 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-07 23:48:43,826 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-07 23:48:43,830 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-07 23:48:43,831 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:48:43,831 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:48:43" (1/3) ...
[2024-11-07 23:48:43,832 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66888635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:48:43, skipping insertion in model container
[2024-11-07 23:48:43,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:48:43,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:48:43" (2/3) ...
[2024-11-07 23:48:43,832 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66888635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:48:43, skipping insertion in model container
[2024-11-07 23:48:43,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:48:43,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:48:43" (3/3) ...
[2024-11-07 23:48:43,834 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c
[2024-11-07 23:48:43,888 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-07 23:48:43,889 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-07 23:48:43,889 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-07 23:48:43,889 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-07 23:48:43,889 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-07 23:48:43,889 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-07 23:48:43,890 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-07 23:48:43,890 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-07 23:48:43,894 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)
[2024-11-07 23:48:43,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:48:43,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:43,907 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:43,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:48:43,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:43,910 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-07 23:48:43,910 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)
[2024-11-07 23:48:43,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:48:43,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:43,911 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:43,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:48:43,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:43,916 INFO L745 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;havoc main_#t~nondet0#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
[2024-11-07 23:48:43,917 INFO L747 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
[2024-11-07 23:48:43,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-07 23:48:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675950675]
[2024-11-07 23:48:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:43,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:43,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:43,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times
[2024-11-07 23:48:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814727127]
[2024-11-07 23:48:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814727127]
[2024-11-07 23:48:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814727127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:48:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:48:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:48:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934846884]
[2024-11-07 23:48:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:48:44,084 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:48:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 23:48:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 23:48:44,109 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)
[2024-11-07 23:48:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:44,139 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions.
[2024-11-07 23:48:44,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions.
[2024-11-07 23:48:44,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12
[2024-11-07 23:48:44,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions.
[2024-11-07 23:48:44,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14
[2024-11-07 23:48:44,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14
[2024-11-07 23:48:44,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions.
[2024-11-07 23:48:44,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:48:44,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions.
[2024-11-07 23:48:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions.
[2024-11-07 23:48:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2024-11-07 23:48:44,166 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)
[2024-11-07 23:48:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions.
[2024-11-07 23:48:44,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions.
[2024-11-07 23:48:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 23:48:44,172 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions.
[2024-11-07 23:48:44,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-07 23:48:44,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions.
[2024-11-07 23:48:44,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12
[2024-11-07 23:48:44,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:44,175 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:44,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:48:44,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:44,175 INFO L745 eck$LassoCheckResult]: Stem: 43#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 44#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 48#L26-1
[2024-11-07 23:48:44,176 INFO L747 eck$LassoCheckResult]: Loop: 48#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 54#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 51#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 49#L17-1 assume !(1 == main_~up~0#1); 50#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 46#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 48#L26-1
[2024-11-07 23:48:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2024-11-07 23:48:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098901018]
[2024-11-07 23:48:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times
[2024-11-07 23:48:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238098648]
[2024-11-07 23:48:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238098648]
[2024-11-07 23:48:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238098648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:48:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:48:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:48:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349373767]
[2024-11-07 23:48:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:48:44,259 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:48:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 23:48:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 23:48:44,259 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)
[2024-11-07 23:48:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:44,326 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions.
[2024-11-07 23:48:44,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions.
[2024-11-07 23:48:44,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36
[2024-11-07 23:48:44,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions.
[2024-11-07 23:48:44,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38
[2024-11-07 23:48:44,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38
[2024-11-07 23:48:44,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions.
[2024-11-07 23:48:44,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:48:44,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions.
[2024-11-07 23:48:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions.
[2024-11-07 23:48:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2024-11-07 23:48:44,334 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)
[2024-11-07 23:48:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions.
[2024-11-07 23:48:44,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions.
[2024-11-07 23:48:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 23:48:44,336 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions.
[2024-11-07 23:48:44,336 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-07 23:48:44,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions.
[2024-11-07 23:48:44,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36
[2024-11-07 23:48:44,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:44,338 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:44,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:48:44,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:44,339 INFO L745 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 103#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 110#L26-1
[2024-11-07 23:48:44,339 INFO L747 eck$LassoCheckResult]: Loop: 110#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 125#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 119#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 115#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 116#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 121#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 110#L26-1
[2024-11-07 23:48:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2024-11-07 23:48:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962811117]
[2024-11-07 23:48:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times
[2024-11-07 23:48:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745994382]
[2024-11-07 23:48:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745994382]
[2024-11-07 23:48:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745994382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:48:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:48:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:48:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170649584]
[2024-11-07 23:48:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:48:44,377 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:48:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 23:48:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 23:48:44,377 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)
[2024-11-07 23:48:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:44,394 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions.
[2024-11-07 23:48:44,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions.
[2024-11-07 23:48:44,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36
[2024-11-07 23:48:44,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions.
[2024-11-07 23:48:44,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38
[2024-11-07 23:48:44,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38
[2024-11-07 23:48:44,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions.
[2024-11-07 23:48:44,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:48:44,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions.
[2024-11-07 23:48:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions.
[2024-11-07 23:48:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32.
[2024-11-07 23:48:44,400 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)
[2024-11-07 23:48:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions.
[2024-11-07 23:48:44,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions.
[2024-11-07 23:48:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 23:48:44,402 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions.
[2024-11-07 23:48:44,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-07 23:48:44,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions.
[2024-11-07 23:48:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30
[2024-11-07 23:48:44,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:44,403 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:44,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:48:44,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:44,404 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 185#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 188#L26-1
[2024-11-07 23:48:44,404 INFO L747 eck$LassoCheckResult]: Loop: 188#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 199#L14 assume !(0 == main_~i~0#1); 205#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 203#L17-1 assume !(1 == main_~up~0#1); 202#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 200#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 188#L26-1
[2024-11-07 23:48:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2024-11-07 23:48:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620431300]
[2024-11-07 23:48:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times
[2024-11-07 23:48:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639855086]
[2024-11-07 23:48:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times
[2024-11-07 23:48:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827426437]
[2024-11-07 23:48:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:44,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:44,564 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:44,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:44,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:44,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:44,565 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-07 23:48:44,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:44,565 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:44,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop
[2024-11-07 23:48:44,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:44,565 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:44,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,720 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:44,721 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-07 23:48:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:44,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:44,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-07 23:48:44,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:44,728 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:44,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0
[2024-11-07 23:48:44,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:44,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:44,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-07 23:48:44,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-07 23:48:44,756 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:44,789 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-07 23:48:44,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-07 23:48:44,793 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:44,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:44,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:44,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:44,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:48:44,794 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:44,794 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:44,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop
[2024-11-07 23:48:44,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:44,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:44,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:44,913 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:44,916 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:48:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:44,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-07 23:48:44,923 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
[2024-11-07 23:48:44,936 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:44,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:48:44,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:44,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:44,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:44,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:48:44,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:48:44,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:48:44,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-07 23:48:44,957 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero.
[2024-11-07 23:48:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:44,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-07 23:48:44,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:48:44,966 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-07 23:48:44,966 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:48:44,966 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1
Supporting invariants []
[2024-11-07 23:48:44,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-07 23:48:44,983 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-07 23:48:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:45,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:45,015 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:45,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:45,028 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:45,104 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
[2024-11-07 23:48:45,106 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)
[2024-11-07 23:48:45,178 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.
[2024-11-07 23:48:45,180 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
[2024-11-07 23:48:45,180 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)
[2024-11-07 23:48:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions.
[2024-11-07 23:48:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters.
[2024-11-07 23:48:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters.
[2024-11-07 23:48:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters.
[2024-11-07 23:48:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:45,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions.
[2024-11-07 23:48:45,193 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60
[2024-11-07 23:48:45,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions.
[2024-11-07 23:48:45,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63
[2024-11-07 23:48:45,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66
[2024-11-07 23:48:45,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions.
[2024-11-07 23:48:45,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:45,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions.
[2024-11-07 23:48:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions.
[2024-11-07 23:48:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89.
[2024-11-07 23:48:45,204 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)
[2024-11-07 23:48:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions.
[2024-11-07 23:48:45,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions.
[2024-11-07 23:48:45,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions.
[2024-11-07 23:48:45,205 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-07 23:48:45,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions.
[2024-11-07 23:48:45,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54
[2024-11-07 23:48:45,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:45,207 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:45,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-07 23:48:45,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:45,208 INFO L745 eck$LassoCheckResult]: Stem: 365#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14
[2024-11-07 23:48:45,208 INFO L747 eck$LassoCheckResult]: Loop: 384#L14 assume !(0 == main_~i~0#1); 435#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 431#L17-1 assume !(1 == main_~up~0#1); 428#L20-1 assume !(0 == main_~up~0#1); 424#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 423#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14
[2024-11-07 23:48:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times
[2024-11-07 23:48:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016096240]
[2024-11-07 23:48:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times
[2024-11-07 23:48:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870834221]
[2024-11-07 23:48:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times
[2024-11-07 23:48:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492352220]
[2024-11-07 23:48:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:45,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-07 23:48:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492352220]
[2024-11-07 23:48:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492352220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:48:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:48:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:48:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094953046]
[2024-11-07 23:48:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:48:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 23:48:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 23:48:45,333 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)
[2024-11-07 23:48:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:45,348 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions.
[2024-11-07 23:48:45,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions.
[2024-11-07 23:48:45,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38
[2024-11-07 23:48:45,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions.
[2024-11-07 23:48:45,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45
[2024-11-07 23:48:45,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45
[2024-11-07 23:48:45,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions.
[2024-11-07 23:48:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:45,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions.
[2024-11-07 23:48:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions.
[2024-11-07 23:48:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65.
[2024-11-07 23:48:45,358 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)
[2024-11-07 23:48:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions.
[2024-11-07 23:48:45,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions.
[2024-11-07 23:48:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 23:48:45,360 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions.
[2024-11-07 23:48:45,360 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-07 23:48:45,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions.
[2024-11-07 23:48:45,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35
[2024-11-07 23:48:45,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:45,361 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:45,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2024-11-07 23:48:45,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:45,362 INFO L745 eck$LassoCheckResult]: Stem: 539#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 540#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 568#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 582#L14-2
[2024-11-07 23:48:45,362 INFO L747 eck$LassoCheckResult]: Loop: 582#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 593#L17-1 assume !(1 == main_~up~0#1); 591#L20-1 assume !(0 == main_~up~0#1); 588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 535#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 536#L14 assume !(0 == main_~i~0#1); 582#L14-2
[2024-11-07 23:48:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times
[2024-11-07 23:48:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684942530]
[2024-11-07 23:48:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times
[2024-11-07 23:48:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342244299]
[2024-11-07 23:48:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times
[2024-11-07 23:48:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124252447]
[2024-11-07 23:48:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124252447]
[2024-11-07 23:48:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124252447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:48:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:48:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:48:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869855708]
[2024-11-07 23:48:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:48:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 23:48:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 23:48:45,478 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)
[2024-11-07 23:48:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:45,488 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions.
[2024-11-07 23:48:45,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions.
[2024-11-07 23:48:45,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2024-11-07 23:48:45,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions.
[2024-11-07 23:48:45,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34
[2024-11-07 23:48:45,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34
[2024-11-07 23:48:45,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions.
[2024-11-07 23:48:45,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:45,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions.
[2024-11-07 23:48:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions.
[2024-11-07 23:48:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42.
[2024-11-07 23:48:45,492 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)
[2024-11-07 23:48:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions.
[2024-11-07 23:48:45,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions.
[2024-11-07 23:48:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 23:48:45,493 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions.
[2024-11-07 23:48:45,493 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-07 23:48:45,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions.
[2024-11-07 23:48:45,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2024-11-07 23:48:45,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:45,494 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:45,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1]
[2024-11-07 23:48:45,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:45,494 INFO L745 eck$LassoCheckResult]: Stem: 661#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 662#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 675#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 658#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1
[2024-11-07 23:48:45,494 INFO L747 eck$LassoCheckResult]: Loop: 682#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 663#L20-1 assume !(0 == main_~up~0#1); 664#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 689#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 684#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1
[2024-11-07 23:48:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times
[2024-11-07 23:48:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452752896]
[2024-11-07 23:48:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times
[2024-11-07 23:48:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686175228]
[2024-11-07 23:48:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times
[2024-11-07 23:48:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049229424]
[2024-11-07 23:48:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:45,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:45,612 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:45,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:45,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:45,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:45,612 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-07 23:48:45,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:45,613 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:45,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop
[2024-11-07 23:48:45,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:45,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:45,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:45,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:45,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:45,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:45,743 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:45,743 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-07 23:48:45,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:45,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:45,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-07 23:48:45,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:45,750 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:45,773 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-07 23:48:45,773 INFO L401 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: []
[2024-11-07 23:48:45,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2024-11-07 23:48:45,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:45,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:45,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-07 23:48:45,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:45,796 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:45,820 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-07 23:48:45,820 INFO L401 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: []
[2024-11-07 23:48:45,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-07 23:48:45,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:45,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:45,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-07 23:48:45,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:45,841 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:45,855 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-07 23:48:45,855 INFO L401 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: []
[2024-11-07 23:48:45,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-07 23:48:45,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:45,873 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:45,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-07 23:48:45,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:45,876 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:45,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-07 23:48:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:45,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:45,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-07 23:48:45,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-07 23:48:45,902 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:46,096 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-07 23:48:46,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-07 23:48:46,101 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:46,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:46,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:46,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:46,102 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:48:46,102 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:46,102 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:46,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop
[2024-11-07 23:48:46,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:46,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:46,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,227 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:46,227 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:48:46,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,233 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
[2024-11-07 23:48:46,245 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:46,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:46,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:46,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:46,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:48:46,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:48:46,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:48:46,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-07 23:48:46,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,270 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,272 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
[2024-11-07 23:48:46,284 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:46,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:46,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:46,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:46,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:48:46,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:48:46,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:48:46,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2024-11-07 23:48:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,307 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,309 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
[2024-11-07 23:48:46,321 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:46,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:48:46,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:46,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:46,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:46,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:48:46,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:48:46,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:48:46,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2024-11-07 23:48:46,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,343 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
[2024-11-07 23:48:46,352 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:46,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:48:46,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:46,352 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts
[2024-11-07 23:48:46,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:46,356 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications.
[2024-11-07 23:48:46,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:48:46,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:48:46,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-07 23:48:46,363 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-07 23:48:46,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,366 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:48:46,367 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-07 23:48:46,367 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:48:46,367 INFO L476 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 []
[2024-11-07 23:48:46,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0
[2024-11-07 23:48:46,378 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-07 23:48:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:46,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:46,405 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:46,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:46,420 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:46,468 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
[2024-11-07 23:48:46,469 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)
[2024-11-07 23:48:46,509 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.
[2024-11-07 23:48:46,511 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
[2024-11-07 23:48:46,512 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)
[2024-11-07 23:48:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions.
[2024-11-07 23:48:46,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters.
[2024-11-07 23:48:46,513 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:46,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-07 23:48:46,513 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:46,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters.
[2024-11-07 23:48:46,514 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:46,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions.
[2024-11-07 23:48:46,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2024-11-07 23:48:46,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions.
[2024-11-07 23:48:46,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42
[2024-11-07 23:48:46,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45
[2024-11-07 23:48:46,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions.
[2024-11-07 23:48:46,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:46,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions.
[2024-11-07 23:48:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions.
[2024-11-07 23:48:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72.
[2024-11-07 23:48:46,522 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)
[2024-11-07 23:48:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions.
[2024-11-07 23:48:46,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions.
[2024-11-07 23:48:46,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions.
[2024-11-07 23:48:46,523 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-07 23:48:46,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions.
[2024-11-07 23:48:46,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2024-11-07 23:48:46,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:46,525 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:46,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:46,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:46,525 INFO L745 eck$LassoCheckResult]: Stem: 851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 852#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 863#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 903#L14 assume !(0 == main_~i~0#1); 904#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 861#L17-1 assume !(1 == main_~up~0#1); 862#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 894#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 917#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 916#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1
[2024-11-07 23:48:46,526 INFO L747 eck$LassoCheckResult]: Loop: 915#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 914#L20-1 assume !(0 == main_~up~0#1); 857#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 882#L14 assume !(0 == main_~i~0#1); 880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1
[2024-11-07 23:48:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times
[2024-11-07 23:48:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946516427]
[2024-11-07 23:48:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:46,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2024-11-07 23:48:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946516427]
[2024-11-07 23:48:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946516427] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:48:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498243714]
[2024-11-07 23:48:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:48:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,599 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:46,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:46,631 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:46,653 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:48:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498243714] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:48:46,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:48:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2024-11-07 23:48:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059000773]
[2024-11-07 23:48:46,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:48:46,683 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:48:46,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times
[2024-11-07 23:48:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401310683]
[2024-11-07 23:48:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:46,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:46,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:46,744 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:46,744 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:46,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:46,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:46,745 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-07 23:48:46,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:46,745 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:46,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop
[2024-11-07 23:48:46,745 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:46,745 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:46,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:46,857 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:46,857 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-07 23:48:46,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,859 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:46,861 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:46,878 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-07 23:48:46,878 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-07 23:48:46,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2024-11-07 23:48:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,891 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:46,893 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:46,904 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-07 23:48:46,904 INFO L401 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: []
[2024-11-07 23:48:46,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2024-11-07 23:48:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,917 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-07 23:48:46,919 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:46,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2024-11-07 23:48:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:46,943 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:46,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2024-11-07 23:48:46,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-07 23:48:46,944 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-07 23:48:47,102 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-07 23:48:47,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2024-11-07 23:48:47,107 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:48:47,107 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:48:47,107 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:48:47,107 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:48:47,107 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:48:47,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:47,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:48:47,107 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:48:47,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop
[2024-11-07 23:48:47,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:48:47,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:48:47,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:47,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:47,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:47,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:48:47,234 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:48:47,234 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:48:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:47,237 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2024-11-07 23:48:47,239 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
[2024-11-07 23:48:47,251 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:47,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:48:47,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:47,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:47,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:47,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:48:47,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:48:47,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:48:47,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0
[2024-11-07 23:48:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:47,268 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:47,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2024-11-07 23:48:47,271 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
[2024-11-07 23:48:47,283 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:47,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:47,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:48:47,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:47,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:48:47,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:48:47,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:48:47,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0
[2024-11-07 23:48:47,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:47,307 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:47,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2024-11-07 23:48:47,309 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
[2024-11-07 23:48:47,322 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:48:47,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:48:47,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:48:47,322 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts
[2024-11-07 23:48:47,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:48:47,324 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications.
[2024-11-07 23:48:47,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:48:47,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:48:47,334 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2024-11-07 23:48:47,335 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero.
[2024-11-07 23:48:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:48:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:47,338 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:48:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2024-11-07 23:48:47,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:48:47,340 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-07 23:48:47,340 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:48:47,340 INFO L476 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 []
[2024-11-07 23:48:47,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2024-11-07 23:48:47,355 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-07 23:48:47,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,376 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,393 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:47,424 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
[2024-11-07 23:48:47,425 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)
[2024-11-07 23:48:47,456 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.
[2024-11-07 23:48:47,458 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
[2024-11-07 23:48:47,458 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)
[2024-11-07 23:48:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions.
[2024-11-07 23:48:47,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-07 23:48:47,459 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:47,459 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:48:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,477 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,496 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:47,530 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
[2024-11-07 23:48:47,530 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)
[2024-11-07 23:48:47,576 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.
[2024-11-07 23:48:47,576 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
[2024-11-07 23:48:47,577 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)
[2024-11-07 23:48:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions.
[2024-11-07 23:48:47,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-07 23:48:47,578 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:47,578 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:48:47,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,595 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,616 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:47,660 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
[2024-11-07 23:48:47,660 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)
[2024-11-07 23:48:47,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2024-11-07 23:48:47,692 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.
[2024-11-07 23:48:47,693 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
[2024-11-07 23:48:47,693 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)
[2024-11-07 23:48:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions.
[2024-11-07 23:48:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters.
[2024-11-07 23:48:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters.
[2024-11-07 23:48:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters.
[2024-11-07 23:48:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:48:47,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions.
[2024-11-07 23:48:47,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35
[2024-11-07 23:48:47,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions.
[2024-11-07 23:48:47,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34
[2024-11-07 23:48:47,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40
[2024-11-07 23:48:47,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions.
[2024-11-07 23:48:47,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:47,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions.
[2024-11-07 23:48:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions.
[2024-11-07 23:48:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50.
[2024-11-07 23:48:47,700 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)
[2024-11-07 23:48:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions.
[2024-11-07 23:48:47,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions.
[2024-11-07 23:48:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 23:48:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 23:48:47,701 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)
[2024-11-07 23:48:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:47,779 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions.
[2024-11-07 23:48:47,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions.
[2024-11-07 23:48:47,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82
[2024-11-07 23:48:47,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions.
[2024-11-07 23:48:47,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95
[2024-11-07 23:48:47,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95
[2024-11-07 23:48:47,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions.
[2024-11-07 23:48:47,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:47,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions.
[2024-11-07 23:48:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions.
[2024-11-07 23:48:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174.
[2024-11-07 23:48:47,794 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)
[2024-11-07 23:48:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions.
[2024-11-07 23:48:47,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions.
[2024-11-07 23:48:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 23:48:47,797 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions.
[2024-11-07 23:48:47,797 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-07 23:48:47,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions.
[2024-11-07 23:48:47,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79
[2024-11-07 23:48:47,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:47,799 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:47,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1]
[2024-11-07 23:48:47,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-11-07 23:48:47,800 INFO L745 eck$LassoCheckResult]: Stem: 1785#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1786#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1791#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1869#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1868#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1
[2024-11-07 23:48:47,800 INFO L747 eck$LassoCheckResult]: Loop: 1851#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1864#L20-1 assume !(0 == main_~up~0#1); 1862#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1853#L14 assume !(0 == main_~i~0#1); 1850#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1840#L17-1 assume !(1 == main_~up~0#1); 1848#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1849#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1847#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1845#L14 assume !(0 == main_~i~0#1); 1839#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1836#L17-1 assume !(1 == main_~up~0#1); 1834#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1831#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1832#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1844#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1
[2024-11-07 23:48:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times
[2024-11-07 23:48:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810080890]
[2024-11-07 23:48:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:47,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:47,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:47,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times
[2024-11-07 23:48:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142316577]
[2024-11-07 23:48:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:47,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:47,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142316577]
[2024-11-07 23:48:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142316577] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:48:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638492508]
[2024-11-07 23:48:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:47,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:48:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:47,956 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:48:47,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2024-11-07 23:48:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:47,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:47,988 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,026 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:48:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638492508] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:48:48,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:48:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11
[2024-11-07 23:48:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420471445]
[2024-11-07 23:48:48,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:48:48,051 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:48:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 23:48:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-11-07 23:48:48,052 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)
[2024-11-07 23:48:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:48,201 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions.
[2024-11-07 23:48:48,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions.
[2024-11-07 23:48:48,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19
[2024-11-07 23:48:48,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions.
[2024-11-07 23:48:48,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56
[2024-11-07 23:48:48,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68
[2024-11-07 23:48:48,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions.
[2024-11-07 23:48:48,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:48,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions.
[2024-11-07 23:48:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions.
[2024-11-07 23:48:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89.
[2024-11-07 23:48:48,208 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)
[2024-11-07 23:48:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions.
[2024-11-07 23:48:48,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions.
[2024-11-07 23:48:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 23:48:48,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions.
[2024-11-07 23:48:48,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-07 23:48:48,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions.
[2024-11-07 23:48:48,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:48,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:48,210 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:48,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1]
[2024-11-07 23:48:48,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:48,211 INFO L745 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2199#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2204#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2230#L14 assume !(0 == main_~i~0#1); 2228#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2226#L17-1 assume !(1 == main_~up~0#1); 2224#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2219#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2196#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2197#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume !(1 == main_~up~0#1); 2208#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2217#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2248#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2258#L14 assume !(0 == main_~i~0#1); 2256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2254#L17-1 assume !(1 == main_~up~0#1); 2251#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2246#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2247#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2242#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2
[2024-11-07 23:48:48,211 INFO L747 eck$LassoCheckResult]: Loop: 2243#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2205#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2206#L20-1 assume !(0 == main_~up~0#1); 2274#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2273#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2272#L14 assume !(0 == main_~i~0#1); 2270#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2269#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; 2250#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2244#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2245#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2
[2024-11-07 23:48:48,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times
[2024-11-07 23:48:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315996634]
[2024-11-07 23:48:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315996634]
[2024-11-07 23:48:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315996634] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:48:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908550622]
[2024-11-07 23:48:48,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 23:48:48,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:48:48,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:48,273 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:48:48,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2024-11-07 23:48:48,307 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 23:48:48,307 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:48:48,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:48,309 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,341 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:48:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908550622] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:48:48,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:48:48,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2024-11-07 23:48:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731731433]
[2024-11-07 23:48:48,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:48:48,391 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:48:48,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times
[2024-11-07 23:48:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:48,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641333461]
[2024-11-07 23:48:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:48,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:48,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 23:48:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2024-11-07 23:48:48,456 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)
[2024-11-07 23:48:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:48,601 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions.
[2024-11-07 23:48:48,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions.
[2024-11-07 23:48:48,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:48,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions.
[2024-11-07 23:48:48,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88
[2024-11-07 23:48:48,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88
[2024-11-07 23:48:48,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions.
[2024-11-07 23:48:48,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:48,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions.
[2024-11-07 23:48:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions.
[2024-11-07 23:48:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137.
[2024-11-07 23:48:48,607 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)
[2024-11-07 23:48:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions.
[2024-11-07 23:48:48,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions.
[2024-11-07 23:48:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-07 23:48:48,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions.
[2024-11-07 23:48:48,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-07 23:48:48,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions.
[2024-11-07 23:48:48,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:48,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:48,610 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:48,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1]
[2024-11-07 23:48:48,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:48,611 INFO L745 eck$LassoCheckResult]: Stem: 2604#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2605#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2616#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2639#L14 assume !(0 == main_~i~0#1); 2636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2633#L17-1 assume !(1 == main_~up~0#1); 2630#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2625#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2624#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2726#L14 assume !(0 == main_~i~0#1); 2621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume !(1 == main_~up~0#1); 2613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2622#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2723#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2722#L14 assume !(0 == main_~i~0#1); 2721#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2720#L17-1 assume !(1 == main_~up~0#1); 2719#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2718#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2717#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2716#L14 assume !(0 == main_~i~0#1); 2715#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2714#L17-1 assume !(1 == main_~up~0#1); 2713#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2712#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2711#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2710#L14 assume !(0 == main_~i~0#1); 2709#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2708#L17-1 assume !(1 == main_~up~0#1); 2707#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2706#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2705#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2704#L14 assume !(0 == main_~i~0#1); 2703#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2702#L17-1 assume !(1 == main_~up~0#1); 2701#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2700#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2697#L14 assume !(0 == main_~i~0#1); 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2667#L17-1 assume !(1 == main_~up~0#1); 2659#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2654#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2655#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2
[2024-11-07 23:48:48,611 INFO L747 eck$LassoCheckResult]: Loop: 2650#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2610#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2611#L20-1 assume !(0 == main_~up~0#1); 2665#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2663#L14 assume !(0 == main_~i~0#1); 2662#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2661#L17-1 assume !(1 == main_~up~0#1); 2660#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2657#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2651#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2652#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2
[2024-11-07 23:48:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times
[2024-11-07 23:48:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541939995]
[2024-11-07 23:48:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541939995]
[2024-11-07 23:48:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541939995] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:48:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158202136]
[2024-11-07 23:48:48,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:48:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:48:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:48,771 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:48:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process
[2024-11-07 23:48:48,814 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2024-11-07 23:48:48,814 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:48:48,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:48,816 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:48,900 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:48:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158202136] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:48:49,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:48:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18
[2024-11-07 23:48:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292670270]
[2024-11-07 23:48:49,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:48:49,059 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:48:49,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times
[2024-11-07 23:48:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316852747]
[2024-11-07 23:48:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:49,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:49,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-11-07 23:48:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342
[2024-11-07 23:48:49,117 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)
[2024-11-07 23:48:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:49,372 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions.
[2024-11-07 23:48:49,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions.
[2024-11-07 23:48:49,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:49,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions.
[2024-11-07 23:48:49,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136
[2024-11-07 23:48:49,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136
[2024-11-07 23:48:49,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions.
[2024-11-07 23:48:49,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:49,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions.
[2024-11-07 23:48:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions.
[2024-11-07 23:48:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233.
[2024-11-07 23:48:49,386 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)
[2024-11-07 23:48:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions.
[2024-11-07 23:48:49,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions.
[2024-11-07 23:48:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-07 23:48:49,389 INFO L425 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions.
[2024-11-07 23:48:49,389 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============
[2024-11-07 23:48:49,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions.
[2024-11-07 23:48:49,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:49,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:49,390 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:49,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1]
[2024-11-07 23:48:49,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:49,397 INFO L745 eck$LassoCheckResult]: Stem: 3322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3323#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3333#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3348#L14 assume !(0 == main_~i~0#1); 3346#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3345#L17-1 assume !(1 == main_~up~0#1); 3344#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3341#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3340#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3335#L14 assume !(0 == main_~i~0#1); 3336#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3326#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3327#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3538#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3537#L14 assume !(0 == main_~i~0#1); 3536#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3535#L17-1 assume !(1 == main_~up~0#1); 3534#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3533#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3532#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3531#L14 assume !(0 == main_~i~0#1); 3530#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3529#L17-1 assume !(1 == main_~up~0#1); 3528#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3527#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3526#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3525#L14 assume !(0 == main_~i~0#1); 3524#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3523#L17-1 assume !(1 == main_~up~0#1); 3522#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3521#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3520#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3519#L14 assume !(0 == main_~i~0#1); 3518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3517#L17-1 assume !(1 == main_~up~0#1); 3516#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3515#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3513#L14 assume !(0 == main_~i~0#1); 3512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3511#L17-1 assume !(1 == main_~up~0#1); 3510#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3509#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3508#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3507#L14 assume !(0 == main_~i~0#1); 3506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3505#L17-1 assume !(1 == main_~up~0#1); 3504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3503#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3501#L14 assume !(0 == main_~i~0#1); 3500#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3499#L17-1 assume !(1 == main_~up~0#1); 3498#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3497#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3496#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3495#L14 assume !(0 == main_~i~0#1); 3494#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3492#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3491#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3490#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3489#L14 assume !(0 == main_~i~0#1); 3488#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3487#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3485#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3484#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3482#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3481#L17-1 assume !(1 == main_~up~0#1); 3480#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3477#L14 assume !(0 == main_~i~0#1); 3476#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3475#L17-1 assume !(1 == main_~up~0#1); 3474#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3473#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3472#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3471#L14 assume !(0 == main_~i~0#1); 3470#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3469#L17-1 assume !(1 == main_~up~0#1); 3468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3467#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3371#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3390#L14 assume !(0 == main_~i~0#1); 3388#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3383#L17-1 assume !(1 == main_~up~0#1); 3375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3370#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3366#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2
[2024-11-07 23:48:49,397 INFO L747 eck$LassoCheckResult]: Loop: 3367#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); 3382#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3381#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3380#L14 assume !(0 == main_~i~0#1); 3379#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3378#L17-1 assume !(1 == main_~up~0#1); 3377#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3374#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3368#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3369#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2
[2024-11-07 23:48:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times
[2024-11-07 23:48:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649174424]
[2024-11-07 23:48:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:48:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:48:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649174424]
[2024-11-07 23:48:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649174424] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:48:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369755220]
[2024-11-07 23:48:49,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-07 23:48:49,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:48:49,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:48:49,809 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:48:49,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2024-11-07 23:48:49,872 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-07 23:48:49,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:48:49,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-07 23:48:49,877 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:48:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:50,022 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:48:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:48:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369755220] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:48:50,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:48:50,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22
[2024-11-07 23:48:50,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875369546]
[2024-11-07 23:48:50,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:48:50,340 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:48:50,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times
[2024-11-07 23:48:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:50,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409365384]
[2024-11-07 23:48:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:48:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-11-07 23:48:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506
[2024-11-07 23:48:50,414 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)
[2024-11-07 23:48:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:48:50,626 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions.
[2024-11-07 23:48:50,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions.
[2024-11-07 23:48:50,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:50,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions.
[2024-11-07 23:48:50,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160
[2024-11-07 23:48:50,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160
[2024-11-07 23:48:50,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions.
[2024-11-07 23:48:50,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:48:50,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions.
[2024-11-07 23:48:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions.
[2024-11-07 23:48:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281.
[2024-11-07 23:48:50,635 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)
[2024-11-07 23:48:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions.
[2024-11-07 23:48:50,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions.
[2024-11-07 23:48:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2024-11-07 23:48:50,637 INFO L425 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions.
[2024-11-07 23:48:50,637 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============
[2024-11-07 23:48:50,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions.
[2024-11-07 23:48:50,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16
[2024-11-07 23:48:50,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:48:50,639 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:48:50,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1]
[2024-11-07 23:48:50,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:48:50,642 INFO L745 eck$LassoCheckResult]: Stem: 4460#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4461#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;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4466#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4486#L14 assume !(0 == main_~i~0#1); 4484#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4483#L17-1 assume !(1 == main_~up~0#1); 4482#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4474#L14 assume !(0 == main_~i~0#1); 4475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4469#L17-1 assume !(1 == main_~up~0#1); 4470#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4476#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4621#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4620#L14 assume !(0 == main_~i~0#1); 4619#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4618#L17-1 assume !(1 == main_~up~0#1); 4617#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4615#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4614#L14 assume !(0 == main_~i~0#1); 4613#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4612#L17-1 assume !(1 == main_~up~0#1); 4611#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4610#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4609#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4608#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4606#L17-1 assume !(1 == main_~up~0#1); 4605#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4604#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4603#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4602#L14 assume !(0 == main_~i~0#1); 4601#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4600#L17-1 assume !(1 == main_~up~0#1); 4599#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4597#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4596#L14 assume !(0 == main_~i~0#1); 4595#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4594#L17-1 assume !(1 == main_~up~0#1); 4593#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4592#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4591#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4590#L14 assume !(0 == main_~i~0#1); 4589#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4588#L17-1 assume !(1 == main_~up~0#1); 4587#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4586#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4585#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4584#L14 assume !(0 == main_~i~0#1); 4583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4582#L17-1 assume !(1 == main_~up~0#1); 4581#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4580#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4578#L14 assume !(0 == main_~i~0#1); 4577#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4576#L17-1 assume !(1 == main_~up~0#1); 4575#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4574#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4572#L14 assume !(0 == main_~i~0#1); 4571#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4570#L17-1 assume !(1 == main_~up~0#1); 4569#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4568#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4567#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4566#L14 assume !(0 == main_~i~0#1); 4565#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4564#L17-1 assume !(1 == main_~up~0#1); 4563#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4562#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4561#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4560#L14 assume !(0 == main_~i~0#1); 4559#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4558#L17-1 assume !(1 == main_~up~0#1); 4557#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4556#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4555#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4554#L14 assume !(0 == main_~i~0#1); 4553#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4552#L17-1 assume !(1 == main_~up~0#1); 4551#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4550#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4549#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4548#L14 assume !(0 == main_~i~0#1); 4547#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4546#L17-1 assume !(1 == main_~up~0#1); 4545#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4544#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4543#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4542#L14 assume !(0 == main_~i~0#1); 4541#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4540#L17-1 assume !(1 == main_~up~0#1); 4539#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4538#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4536#L14 assume !(0 == main_~i~0#1); 4535#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4534#L17-1 assume !(1 == main_~up~0#1); 4533#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4532#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4531#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4530#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4527#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4526#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume !(0 == main_~i~0#1); 4509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume !(1 == main_~up~0#1); 4503#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4500#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4511#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2
[2024-11-07 23:48:50,642 INFO L747 eck$LassoCheckResult]: Loop: 4512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4504#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4505#L20-1 assume !(0 == main_~up~0#1); 4524#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4523#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4522#L14 assume !(0 == main_~i~0#1); 4521#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4520#L17-1 assume !(1 == main_~up~0#1); 4519#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4517#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2
[2024-11-07 23:48:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times
[2024-11-07 23:48:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626217433]
[2024-11-07 23:48:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times
[2024-11-07 23:48:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446413714]
[2024-11-07 23:48:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:50,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:48:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times
[2024-11-07 23:48:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:48:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223505919]
[2024-11-07 23:48:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:48:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:48:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:50,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:48:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:51,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:48:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:48:51,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 11:48:51 BoogieIcfgContainer
[2024-11-07 23:48:51,841 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-07 23:48:51,842 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 23:48:51,842 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 23:48:51,842 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 23:48:51,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:48:43" (3/4) ...
[2024-11-07 23:48:51,844 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample
[2024-11-07 23:48:51,910 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 23:48:51,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 23:48:51,913 INFO L158 Benchmark]: Toolchain (without parser) took 8515.96ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.8MB in the beginning and 80.1MB in the end (delta: -3.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB.
[2024-11-07 23:48:51,913 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:48:51,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.32ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 66.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 23:48:51,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.12ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 65.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:48:51,913 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 64.9MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:48:51,914 INFO L158 Benchmark]: RCFGBuilder took 227.08ms. Allocated memory is still 100.7MB. Free memory was 64.8MB in the beginning and 56.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 23:48:51,914 INFO L158 Benchmark]: BuchiAutomizer took 8015.83ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 85.8MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:48:51,914 INFO L158 Benchmark]: Witness Printer took 68.79ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 80.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:48:51,916 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.92ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 153.32ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 66.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 21.12ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 65.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 25.19ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 64.9MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 227.08ms. Allocated memory is still 100.7MB. Free memory was 64.8MB in the beginning and 56.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* BuchiAutomizer took 8015.83ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 85.8MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 68.79ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 80.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Constructed decomposition of program
Your program was decomposed into 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 (((long) -1 * i) + range) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -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 7.8s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 5.9s. Construction of modules took 0.6s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 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, 500 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 169 mSDtfsCounter, 789 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 smp57 dnf135 smp95 tf106 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms 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!
[2024-11-07 23:48:51,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0
[2024-11-07 23:48:52,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0
[2024-11-07 23:48:52,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0
[2024-11-07 23:48:52,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0
[2024-11-07 23:48:52,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2024-11-07 23:48:52,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)