./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:01:06,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:01:06,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:01:06,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:01:06,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:01:06,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:01:06,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:01:06,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:01:06,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:01:06,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:01:06,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:01:06,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:01:06,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:01:06,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:01:06,867 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:01:06,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:01:06,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:01:06,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:01:06,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:01:06,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:01:06,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:01:06,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:01:06,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:01:06,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:01:06,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:01:06,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:01:06,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:01:06,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:01:06,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:01:06,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:01:06,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2025-01-09 03:01:07,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:01:07,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:01:07,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:01:07,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:01:07,165 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:01:07,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2025-01-09 03:01:08,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24532d929/a7ce22b1e6fe4ed0bf51e4a6f4c02282/FLAG272fade9c [2025-01-09 03:01:08,796 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:01:08,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2025-01-09 03:01:08,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24532d929/a7ce22b1e6fe4ed0bf51e4a6f4c02282/FLAG272fade9c [2025-01-09 03:01:08,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24532d929/a7ce22b1e6fe4ed0bf51e4a6f4c02282 [2025-01-09 03:01:08,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:01:08,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:01:08,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:01:08,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:01:08,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:01:08,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:01:08" (1/1) ... [2025-01-09 03:01:08,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c612c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:08, skipping insertion in model container [2025-01-09 03:01:08,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:01:08" (1/1) ... [2025-01-09 03:01:08,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:01:09,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2025-01-09 03:01:09,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:01:09,091 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:01:09,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2025-01-09 03:01:09,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:01:09,117 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:01:09,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09 WrapperNode [2025-01-09 03:01:09,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:01:09,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:01:09,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:01:09,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:01:09,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,144 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-01-09 03:01:09,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:01:09,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:01:09,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:01:09,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:01:09,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:01:09,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:01:09,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:01:09,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:01:09,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:01:09,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (1/1) ... [2025-01-09 03:01:09,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:01:09,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:01:09,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:01:09,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:01:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:01:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:01:09,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:01:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:01:09,313 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:01:09,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:01:09,419 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-09 03:01:09,419 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:01:09,431 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:01:09,432 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:01:09,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:01:09 BoogieIcfgContainer [2025-01-09 03:01:09,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:01:09,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:01:09,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:01:09,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:01:09,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:01:08" (1/3) ... [2025-01-09 03:01:09,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd54788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:01:09, skipping insertion in model container [2025-01-09 03:01:09,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:01:09" (2/3) ... [2025-01-09 03:01:09,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd54788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:01:09, skipping insertion in model container [2025-01-09 03:01:09,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:01:09" (3/3) ... [2025-01-09 03:01:09,442 INFO L128 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2025-01-09 03:01:09,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:01:09,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Mono1_1-2.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:01:09,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:01:09,523 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eea69c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:01:09,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:01:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 03:01:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 03:01:09,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:01:09,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 03:01:09,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:01:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:01:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 28702733, now seen corresponding path program 1 times [2025-01-09 03:01:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:01:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902526350] [2025-01-09 03:01:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:01:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:01:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 03:01:09,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 03:01:09,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:01:09,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:01:09,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902526350] [2025-01-09 03:01:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902526350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:01:09,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:01:09,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:01:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779650078] [2025-01-09 03:01:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:01:09,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:01:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:01:09,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:01:09,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:01:09,827 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:01:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:01:09,853 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-01-09 03:01:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:01:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 03:01:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:01:09,861 INFO L225 Difference]: With dead ends: 22 [2025-01-09 03:01:09,862 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 03:01:09,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:01:09,870 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:01:09,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:01:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 03:01:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 03:01:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:01:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-01-09 03:01:09,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-01-09 03:01:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:01:09,902 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-09 03:01:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:01:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-01-09 03:01:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 03:01:09,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:01:09,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:01:09,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:01:09,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:01:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:01:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1805891882, now seen corresponding path program 1 times [2025-01-09 03:01:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:01:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278625087] [2025-01-09 03:01:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:01:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:01:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:01:09,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:01:09,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:01:09,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:01:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278625087] [2025-01-09 03:01:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278625087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:01:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667942386] [2025-01-09 03:01:10,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:01:10,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:01:10,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:01:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:01:10,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:01:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:01:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:01:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:10,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:01:10,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:01:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:01:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667942386] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:01:10,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:01:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:01:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165155917] [2025-01-09 03:01:10,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:01:10,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:01:10,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:01:10,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:01:10,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:01:10,267 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 03:01:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:01:10,336 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-01-09 03:01:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:01:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 03:01:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:01:10,338 INFO L225 Difference]: With dead ends: 18 [2025-01-09 03:01:10,338 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:01:10,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:01:10,339 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:01:10,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:01:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:01:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-09 03:01:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 03:01:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-01-09 03:01:10,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2025-01-09 03:01:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:01:10,343 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-01-09 03:01:10,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 03:01:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-01-09 03:01:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:01:10,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:01:10,344 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 03:01:10,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:01:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:10,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:01:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:01:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1575254626, now seen corresponding path program 1 times [2025-01-09 03:01:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:01:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528263897] [2025-01-09 03:01:10,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:01:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:01:10,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:01:10,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:01:10,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:01:10,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:01:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528263897] [2025-01-09 03:01:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528263897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:01:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380795425] [2025-01-09 03:01:10,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:01:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:01:10,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:01:10,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:01:10,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:01:10,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:01:10,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:01:10,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:10,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:01:10,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:01:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:01:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380795425] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:01:10,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:01:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2025-01-09 03:01:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281005214] [2025-01-09 03:01:10,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:01:10,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:01:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:01:10,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:01:10,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:01:10,984 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-09 03:01:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:01:11,093 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-01-09 03:01:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:01:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 03:01:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:01:11,094 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:01:11,095 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 03:01:11,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:01:11,096 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:01:11,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:01:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 03:01:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 03:01:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-09 03:01:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-01-09 03:01:11,104 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 11 [2025-01-09 03:01:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:01:11,104 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-01-09 03:01:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-01-09 03:01:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-01-09 03:01:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 03:01:11,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:01:11,105 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2025-01-09 03:01:11,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:01:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:11,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:01:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:01:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1397472170, now seen corresponding path program 2 times [2025-01-09 03:01:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:01:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805885648] [2025-01-09 03:01:11,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:01:11,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:01:11,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 03:01:11,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 03:01:11,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:01:11,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:01:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805885648] [2025-01-09 03:01:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805885648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:01:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828095316] [2025-01-09 03:01:11,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:01:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:01:11,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:01:11,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:01:11,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 03:01:11,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 03:01:11,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:01:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:11,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 03:01:11,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:01:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:11,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:01:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:01:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828095316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:01:11,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:01:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-01-09 03:01:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699641135] [2025-01-09 03:01:11,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:01:11,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 03:01:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:01:11,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 03:01:11,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:01:11,932 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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-01-09 03:01:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:01:12,485 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-01-09 03:01:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:01:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 03:01:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:01:12,488 INFO L225 Difference]: With dead ends: 38 [2025-01-09 03:01:12,488 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 03:01:12,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:01:12,490 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:01:12,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:01:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 03:01:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 03:01:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 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-01-09 03:01:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-01-09 03:01:12,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2025-01-09 03:01:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:01:12,501 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-01-09 03:01:12,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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-01-09 03:01:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-01-09 03:01:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 03:01:12,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:01:12,502 INFO L218 NwaCegarLoop]: trace histogram [13, 8, 5, 1, 1, 1, 1, 1] [2025-01-09 03:01:12,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:01:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:12,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:01:12,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:01:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 13625788, now seen corresponding path program 3 times [2025-01-09 03:01:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:01:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692702242] [2025-01-09 03:01:12,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:01:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:01:12,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 14 equivalence classes. [2025-01-09 03:01:12,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 27 of 31 statements. [2025-01-09 03:01:12,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-01-09 03:01:12,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 03:01:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:01:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692702242] [2025-01-09 03:01:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692702242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:01:12,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743944330] [2025-01-09 03:01:12,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:01:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:01:12,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:01:12,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:01:12,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:01:13,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 14 equivalence classes. [2025-01-09 03:01:13,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 27 of 31 statements. [2025-01-09 03:01:13,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-01-09 03:01:13,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:01:13,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 03:01:13,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:01:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 03:01:13,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:01:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 03:01:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743944330] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:01:13,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:01:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2025-01-09 03:01:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143302528] [2025-01-09 03:01:13,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:01:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 03:01:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:01:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 03:01:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:01:13,419 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 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-01-09 03:01:17,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:21,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:25,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:29,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:33,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:37,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:41,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:45,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:49,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:53,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:01:57,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:01,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:05,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:09,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:13,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:18,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:02:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:02:18,840 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2025-01-09 03:02:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 03:02:18,841 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 03:02:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:02:18,842 INFO L225 Difference]: With dead ends: 74 [2025-01-09 03:02:18,842 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 03:02:18,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=397, Invalid=659, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 03:02:18,843 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 29 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:02:18,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 246 Invalid, 16 Unknown, 0 Unchecked, 64.5s Time] [2025-01-09 03:02:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 03:02:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2025-01-09 03:02:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:02:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-01-09 03:02:18,852 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 31 [2025-01-09 03:02:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:02:18,852 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-01-09 03:02:18,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 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-01-09 03:02:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-01-09 03:02:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 03:02:18,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:02:18,854 INFO L218 NwaCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1] [2025-01-09 03:02:18,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:02:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:02:19,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:02:19,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:02:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash 437493433, now seen corresponding path program 4 times [2025-01-09 03:02:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:02:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034070772] [2025-01-09 03:02:19,058 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:02:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:02:19,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 03:02:19,082 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 03:02:19,082 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:02:19,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:02:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-09 03:02:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:02:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034070772] [2025-01-09 03:02:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034070772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:02:19,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441911043] [2025-01-09 03:02:19,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:02:19,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:02:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:02:19,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:02:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:02:19,327 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 03:02:19,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 03:02:19,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:02:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:02:19,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 03:02:19,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:02:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:02:19,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:02:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:02:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441911043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:02:20,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:02:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 42 [2025-01-09 03:02:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701976872] [2025-01-09 03:02:20,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:02:20,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 03:02:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:02:20,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 03:02:20,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1231, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 03:02:20,752 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 42 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)