./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:49:01,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:01,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:01,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:01,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:01,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:01,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:01,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:01,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:01,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:01,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:01,888 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:01,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:01,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:01,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:01,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:01,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:01,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:01,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:01,891 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:01,891 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/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 -> 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 [2025-03-09 06:49:02,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:02,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:02,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:02,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:02,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:02,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-03-09 06:49:03,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4821a7463/22bdb452ed424a7ba547cec051f082ed/FLAGd25b74cbb [2025-03-09 06:49:03,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:03,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-03-09 06:49:03,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4821a7463/22bdb452ed424a7ba547cec051f082ed/FLAGd25b74cbb [2025-03-09 06:49:03,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4821a7463/22bdb452ed424a7ba547cec051f082ed [2025-03-09 06:49:03,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:03,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:03,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:03,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:03,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:03,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1072e021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03, skipping insertion in model container [2025-03-09 06:49:03,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:03,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:03,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:03,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:03,880 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:03,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03 WrapperNode [2025-03-09 06:49:03,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:03,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:03,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:03,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:03,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,899 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2025-03-09 06:49:03,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:03,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:03,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:03,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:03,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,909 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:49:03,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:03,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:03,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:03,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:03,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (1/1) ... [2025-03-09 06:49:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:03,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:03,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:03,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:49:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:03,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:04,007 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:04,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:04,070 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:04,070 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:04,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:04,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:04,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:04 BoogieIcfgContainer [2025-03-09 06:49:04,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:04,079 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:04,079 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:04,083 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:04,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:04,084 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:03" (1/3) ... [2025-03-09 06:49:04,085 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8a5bca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:04, skipping insertion in model container [2025-03-09 06:49:04,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:04,085 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:03" (2/3) ... [2025-03-09 06:49:04,086 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8a5bca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:04, skipping insertion in model container [2025-03-09 06:49:04,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:04,086 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:04" (3/3) ... [2025-03-09 06:49:04,087 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2025-03-09 06:49:04,123 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:04,124 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:04,124 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:04,124 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:04,124 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:04,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:04,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:04,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:04,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2025-03-09 06:49:04,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:04,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:04,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:04,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:04,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:04,138 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:04,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2025-03-09 06:49:04,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:04,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:04,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:04,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:04,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:04,143 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:04,144 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:04,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-09 06:49:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991824978] [2025-03-09 06:49:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:04,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-03-09 06:49:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98249129] [2025-03-09 06:49:04,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98249129] [2025-03-09 06:49:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98249129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:49:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381276264] [2025-03-09 06:49:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:04,285 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:04,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:49:04,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:49:04,306 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:04,323 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-09 06:49:04,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-09 06:49:04,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:04,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 5 states and 6 transitions. [2025-03-09 06:49:04,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-09 06:49:04,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-09 06:49:04,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-03-09 06:49:04,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:04,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-09 06:49:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-03-09 06:49:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-03-09 06:49:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) 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) [2025-03-09 06:49:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-03-09 06:49:04,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-09 06:49:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:49:04,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-09 06:49:04,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:04,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-03-09 06:49:04,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:04,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:04,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:04,354 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:04,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:04,355 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:04,355 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:04,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-03-09 06:49:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343390893] [2025-03-09 06:49:04,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:04,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 34723, now seen corresponding path program 1 times [2025-03-09 06:49:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852710101] [2025-03-09 06:49:04,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:04,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:04,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852710101] [2025-03-09 06:49:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852710101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720039166] [2025-03-09 06:49:04,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:04,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:04,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:04,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:49:04,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:04,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:04,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:49:04,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720039166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:04,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-09 06:49:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702647715] [2025-03-09 06:49:04,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:04,502 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:04,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:49:04,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:49:04,503 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2025-03-09 06:49:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:04,518 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-09 06:49:04,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-09 06:49:04,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:49:04,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-03-09 06:49:04,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:49:04,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:49:04,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-03-09 06:49:04,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:04,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 06:49:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-03-09 06:49:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-09 06:49:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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) [2025-03-09 06:49:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-09 06:49:04,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 06:49:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:49:04,521 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 06:49:04,521 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:49:04,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-03-09 06:49:04,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:49:04,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:04,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:04,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:04,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-03-09 06:49:04,522 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:04,522 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:04,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 3 times [2025-03-09 06:49:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526183100] [2025-03-09 06:49:04,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:49:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:04,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1034466655, now seen corresponding path program 2 times [2025-03-09 06:49:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113063647] [2025-03-09 06:49:04,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-09 06:49:04,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:04,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:04,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113063647] [2025-03-09 06:49:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113063647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858278332] [2025-03-09 06:49:04,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:04,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:04,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:49:04,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-09 06:49:04,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:04,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:04,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:04,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:04,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858278332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:04,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 06:49:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145838843] [2025-03-09 06:49:04,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:04,735 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:04,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:49:04,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:49:04,736 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:04,763 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-03-09 06:49:04,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2025-03-09 06:49:04,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-09 06:49:04,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2025-03-09 06:49:04,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-09 06:49:04,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 06:49:04,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2025-03-09 06:49:04,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:04,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-09 06:49:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2025-03-09 06:49:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 06:49:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-09 06:49:04,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-09 06:49:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:49:04,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-09 06:49:04,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:49:04,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2025-03-09 06:49:04,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-09 06:49:04,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:04,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:04,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:04,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 1, 1] [2025-03-09 06:49:04,768 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:04,768 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 4 times [2025-03-09 06:49:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895010919] [2025-03-09 06:49:04,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,771 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:49:04,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:04,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:04,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:04,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:04,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:04,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:04,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:04,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash 82890463, now seen corresponding path program 3 times [2025-03-09 06:49:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:04,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395401920] [2025-03-09 06:49:04,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:04,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-09 06:49:04,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:49:04,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:49:04,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395401920] [2025-03-09 06:49:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395401920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524729320] [2025-03-09 06:49:05,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:05,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:05,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:05,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:05,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:49:05,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-09 06:49:05,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:49:05,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:49:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:05,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:05,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:05,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524729320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:05,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:05,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-09 06:49:05,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729225392] [2025-03-09 06:49:05,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:05,295 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:05,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:05,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:49:05,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:49:05,298 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 2 Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:05,331 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-09 06:49:05,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2025-03-09 06:49:05,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-09 06:49:05,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2025-03-09 06:49:05,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 06:49:05,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 06:49:05,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2025-03-09 06:49:05,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:05,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-09 06:49:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2025-03-09 06:49:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-09 06:49:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-09 06:49:05,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-09 06:49:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:49:05,335 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-09 06:49:05,335 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:49:05,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2025-03-09 06:49:05,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-09 06:49:05,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:05,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:05,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:05,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 1, 1] [2025-03-09 06:49:05,336 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:05,336 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 5 times [2025-03-09 06:49:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112820979] [2025-03-09 06:49:05,336 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:05,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:05,340 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:05,340 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:05,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:05,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1301127647, now seen corresponding path program 4 times [2025-03-09 06:49:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399151415] [2025-03-09 06:49:05,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:05,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:05,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-09 06:49:05,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:49:05,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:05,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399151415] [2025-03-09 06:49:05,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399151415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450951380] [2025-03-09 06:49:05,814 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:05,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:05,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:05,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:05,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:49:05,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-09 06:49:05,847 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:49:05,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:05,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:05,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:49:05,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:05,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450951380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:06,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-09 06:49:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530996774] [2025-03-09 06:49:06,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:06,572 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:06,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 06:49:06,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 06:49:06,574 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:06,633 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-03-09 06:49:06,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2025-03-09 06:49:06,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-09 06:49:06,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2025-03-09 06:49:06,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-09 06:49:06,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-09 06:49:06,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2025-03-09 06:49:06,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:06,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-09 06:49:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2025-03-09 06:49:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 06:49:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-03-09 06:49:06,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-09 06:49:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 06:49:06,643 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-09 06:49:06,643 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:49:06,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2025-03-09 06:49:06,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-09 06:49:06,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:06,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:06,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:06,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 1, 1] [2025-03-09 06:49:06,644 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:06,644 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 6 times [2025-03-09 06:49:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394879736] [2025-03-09 06:49:06,647 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:06,650 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:06,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:06,650 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:49:06,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:06,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:06,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:06,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:06,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1902524449, now seen corresponding path program 5 times [2025-03-09 06:49:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438099266] [2025-03-09 06:49:06,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:06,662 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-09 06:49:06,694 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:49:06,694 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-09 06:49:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438099266] [2025-03-09 06:49:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438099266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918455612] [2025-03-09 06:49:07,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:07,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:07,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:49:07,960 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-09 06:49:07,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 06:49:07,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-09 06:49:07,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:07,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 06:49:07,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:08,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:10,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918455612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:10,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-09 06:49:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844381289] [2025-03-09 06:49:10,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:10,072 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:10,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 06:49:10,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 06:49:10,076 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 2 Second operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:10,186 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2025-03-09 06:49:10,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2025-03-09 06:49:10,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-09 06:49:10,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2025-03-09 06:49:10,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-09 06:49:10,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-09 06:49:10,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2025-03-09 06:49:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:10,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-09 06:49:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2025-03-09 06:49:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-09 06:49:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2025-03-09 06:49:10,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-09 06:49:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 06:49:10,195 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-09 06:49:10,195 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:49:10,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2025-03-09 06:49:10,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-09 06:49:10,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:10,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:10,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:10,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 1, 1] [2025-03-09 06:49:10,197 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:10,197 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:10,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 7 times [2025-03-09 06:49:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433900103] [2025-03-09 06:49:10,198 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:10,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:10,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:10,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:10,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:10,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:10,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2096894943, now seen corresponding path program 6 times [2025-03-09 06:49:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585213746] [2025-03-09 06:49:10,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:10,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-09 06:49:10,247 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:49:10,247 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-09 06:49:10,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585213746] [2025-03-09 06:49:13,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585213746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413356792] [2025-03-09 06:49:13,472 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:49:13,498 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-09 06:49:13,539 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:49:13,539 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-09 06:49:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:13,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-09 06:49:13,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:13,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413356792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:20,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-09 06:49:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225954334] [2025-03-09 06:49:20,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:20,632 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-09 06:49:20,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-09 06:49:20,640 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 2 Second operand has 192 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:20,896 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2025-03-09 06:49:20,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2025-03-09 06:49:20,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-09 06:49:20,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2025-03-09 06:49:20,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-03-09 06:49:20,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2025-03-09 06:49:20,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2025-03-09 06:49:20,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:20,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-09 06:49:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2025-03-09 06:49:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-09 06:49:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2025-03-09 06:49:20,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-09 06:49:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-09 06:49:20,908 INFO L432 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-09 06:49:20,908 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:49:20,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2025-03-09 06:49:20,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-09 06:49:20,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:20,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:20,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:20,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [190, 1, 1] [2025-03-09 06:49:20,911 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:49:20,911 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:49:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 8 times [2025-03-09 06:49:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269054294] [2025-03-09 06:49:20,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:20,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:20,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:20,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1927850975, now seen corresponding path program 7 times [2025-03-09 06:49:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217837274] [2025-03-09 06:49:20,915 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-09 06:49:20,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-09 06:49:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217837274] [2025-03-09 06:49:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217837274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757734555] [2025-03-09 06:49:32,762 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:32,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:32,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:49:32,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-09 06:49:32,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-09 06:49:32,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:32,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:32,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-09 06:49:32,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:33,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:50:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757734555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:00,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-03-09 06:50:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873882088] [2025-03-09 06:50:00,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:00,741 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:50:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:00,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-09 06:50:00,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-09 06:50:00,761 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. cyclomatic complexity: 2 Second operand has 384 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:50:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:01,670 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2025-03-09 06:50:01,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 387 transitions. [2025-03-09 06:50:01,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-09 06:50:01,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 387 transitions. [2025-03-09 06:50:01,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2025-03-09 06:50:01,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-03-09 06:50:01,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 387 transitions. [2025-03-09 06:50:01,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:50:01,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-09 06:50:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 387 transitions. [2025-03-09 06:50:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-09 06:50:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.0025906735751295) internal successors, (387), 385 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:50:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2025-03-09 06:50:01,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-09 06:50:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-09 06:50:01,689 INFO L432 stractBuchiCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-09 06:50:01,689 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:50:01,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 387 transitions. [2025-03-09 06:50:01,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-09 06:50:01,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:01,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:01,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:50:01,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [382, 1, 1] [2025-03-09 06:50:01,693 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-09 06:50:01,693 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-09 06:50:01,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 9 times [2025-03-09 06:50:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546236603] [2025-03-09 06:50:01,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:01,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:50:01,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:50:01,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:50:01,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:01,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:01,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:50:01,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:50:01,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:01,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:01,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 56744927, now seen corresponding path program 8 times [2025-03-09 06:50:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016126443] [2025-03-09 06:50:01,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:01,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-03-09 06:50:01,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 384 of 384 statements. [2025-03-09 06:50:01,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:01,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat