./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/nested3-1.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 ed8e064f31e82b4c33cb383334d25637eef982ae8d5b8603579b97c7fdfe808e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:21:35,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:21:35,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:21:35,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:21:35,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:21:35,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:21:35,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:21:35,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:21:35,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:21:35,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:21:35,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:21:35,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:21:35,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:21:35,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:21:35,299 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:21:35,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:21:35,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:21:35,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:21:35,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:21:35,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:21:35,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:21:35,302 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 -> ed8e064f31e82b4c33cb383334d25637eef982ae8d5b8603579b97c7fdfe808e [2025-02-07 20:21:35,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:21:35,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:21:35,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:21:35,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:21:35,532 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:21:35,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested3-1.c [2025-02-07 20:21:36,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1fa7c5c4/2b44be57ddb74435a6866a796d07f3a3/FLAGd4a159fb7 [2025-02-07 20:21:37,039 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:21:37,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested3-1.c [2025-02-07 20:21:37,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1fa7c5c4/2b44be57ddb74435a6866a796d07f3a3/FLAGd4a159fb7 [2025-02-07 20:21:37,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1fa7c5c4/2b44be57ddb74435a6866a796d07f3a3 [2025-02-07 20:21:37,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:21:37,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:21:37,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:21:37,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:21:37,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:21:37,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8b0787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:21:37,183 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/nested3-1.c[321,334] [2025-02-07 20:21:37,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:21:37,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:21:37,200 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/nested3-1.c[321,334] [2025-02-07 20:21:37,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:21:37,210 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:21:37,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37 WrapperNode [2025-02-07 20:21:37,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:21:37,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:21:37,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:21:37,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:21:37,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,226 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2025-02-07 20:21:37,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:21:37,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:21:37,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:21:37,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:21:37,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,238 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-02-07 20:21:37,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:21:37,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:21:37,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:21:37,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:21:37,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (1/1) ... [2025-02-07 20:21:37,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:21:37,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:37,266 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-02-07 20:21:37,268 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-02-07 20:21:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:21:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:21:37,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:21:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:21:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:21:37,284 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:21:37,319 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:21:37,321 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:21:37,436 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:21:37,436 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:21:37,447 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:21:37,447 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:21:37,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:21:37 BoogieIcfgContainer [2025-02-07 20:21:37,447 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:21:37,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:21:37,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:21:37,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:21:37,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:21:37" (1/3) ... [2025-02-07 20:21:37,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b7a778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:21:37" (2/3) ... [2025-02-07 20:21:37,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b7a778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:21:37, skipping insertion in model container [2025-02-07 20:21:37,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:21:37" (3/3) ... [2025-02-07 20:21:37,453 INFO L128 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2025-02-07 20:21:37,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:21:37,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested3-1.c that has 2 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 20:21:37,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:21:37,498 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;@3f366f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:21:37,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:21:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:21:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:21:37,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:37,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:21:37,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1241825853, now seen corresponding path program 1 times [2025-02-07 20:21:37,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:37,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593824578] [2025-02-07 20:21:37,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:37,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:37,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:21:37,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:21:37,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:37,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593824578] [2025-02-07 20:21:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593824578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:37,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:21:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340274444] [2025-02-07 20:21:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:37,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:37,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:37,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:37,717 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:37,746 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2025-02-07 20:21:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:37,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 20:21:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:37,752 INFO L225 Difference]: With dead ends: 42 [2025-02-07 20:21:37,752 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 20:21:37,756 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-02-07 20:21:37,757 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:37,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 20:21:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2025-02-07 20:21:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 20:21:37,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2025-02-07 20:21:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 20:21:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 20:21:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:21:37,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:37,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:37,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:21:37,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -196770971, now seen corresponding path program 1 times [2025-02-07 20:21:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331021211] [2025-02-07 20:21:37,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:37,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:21:37,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:21:37,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:37,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331021211] [2025-02-07 20:21:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331021211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:21:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610203666] [2025-02-07 20:21:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:37,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:37,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:37,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:37,867 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:37,881 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-02-07 20:21:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:21:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:37,882 INFO L225 Difference]: With dead ends: 34 [2025-02-07 20:21:37,882 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 20:21:37,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-07 20:21:37,882 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:37,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 20:21:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 20:21:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 20:21:37,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2025-02-07 20:21:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 20:21:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 20:21:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:21:37,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:37,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:37,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:21:37,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1847234057, now seen corresponding path program 1 times [2025-02-07 20:21:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628192976] [2025-02-07 20:21:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:21:37,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:21:37,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:37,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:37,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:37,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628192976] [2025-02-07 20:21:37,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628192976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:37,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:37,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:21:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688804073] [2025-02-07 20:21:37,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:37,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:21:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:37,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:21:37,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:21:37,944 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:37,953 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-02-07 20:21:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:21:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:21:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:37,953 INFO L225 Difference]: With dead ends: 33 [2025-02-07 20:21:37,953 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 20:21:37,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-07 20:21:37,954 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:37,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 20:21:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 20:21:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 20:21:37,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-02-07 20:21:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:37,958 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 20:21:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 20:21:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:21:37,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:37,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:37,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:21:37,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:37,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1473829213, now seen corresponding path program 1 times [2025-02-07 20:21:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987021311] [2025-02-07 20:21:37,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:21:37,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:21:37,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:37,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987021311] [2025-02-07 20:21:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987021311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305207470] [2025-02-07 20:21:38,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:38,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:38,078 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-02-07 20:21:38,079 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-02-07 20:21:38,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:21:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:21:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:21:38,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305207470] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:38,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-02-07 20:21:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026988389] [2025-02-07 20:21:38,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:21:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:21:38,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:21:38,186 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,269 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2025-02-07 20:21:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:21:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:21:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,271 INFO L225 Difference]: With dead ends: 57 [2025-02-07 20:21:38,271 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:21:38,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:21:38,272 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 143 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:21:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2025-02-07 20:21:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:21:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-02-07 20:21:38,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 9 [2025-02-07 20:21:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-02-07 20:21:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-02-07 20:21:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:21:38,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,277 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:21:38,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:38,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash -285000457, now seen corresponding path program 2 times [2025-02-07 20:21:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:38,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678916049] [2025-02-07 20:21:38,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:38,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:21:38,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:21:38,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:38,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678916049] [2025-02-07 20:21:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678916049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907082254] [2025-02-07 20:21:38,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:38,578 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-02-07 20:21:38,579 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-02-07 20:21:38,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:21:38,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:21:38,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:38,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:21:38,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907082254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:38,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-07 20:21:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934488792] [2025-02-07 20:21:38,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:21:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:38,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:21:38,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:21:38,696 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:38,857 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2025-02-07 20:21:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:21:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-07 20:21:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:38,859 INFO L225 Difference]: With dead ends: 51 [2025-02-07 20:21:38,859 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:21:38,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:21:38,860 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:38,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:21:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:21:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 20:21:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-02-07 20:21:38,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2025-02-07 20:21:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-02-07 20:21:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-02-07 20:21:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:21:38,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:38,870 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:38,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:21:39,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -884171401, now seen corresponding path program 3 times [2025-02-07 20:21:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775648204] [2025-02-07 20:21:39,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:39,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-02-07 20:21:39,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-02-07 20:21:39,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 20:21:39,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 20:21:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775648204] [2025-02-07 20:21:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775648204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:21:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:21:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:21:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218609469] [2025-02-07 20:21:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:21:39,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:21:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:39,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:21:39,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:21:39,187 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:39,218 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-07 20:21:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:21:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 20:21:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:39,219 INFO L225 Difference]: With dead ends: 34 [2025-02-07 20:21:39,219 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:21:39,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:21:39,220 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:39,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:21:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:21:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-02-07 20:21:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:21:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-02-07 20:21:39,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2025-02-07 20:21:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:39,227 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-02-07 20:21:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:21:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-02-07 20:21:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:21:39,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:39,228 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:21:39,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -284817857, now seen corresponding path program 1 times [2025-02-07 20:21:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931387887] [2025-02-07 20:21:39,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:39,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:21:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:21:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:21:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931387887] [2025-02-07 20:21:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931387887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094974893] [2025-02-07 20:21:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:21:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:39,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:39,405 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-02-07 20:21:39,406 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-02-07 20:21:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:21:39,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:21:39,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:21:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:21:39,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 20:21:39,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-07 20:21:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094974893] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:39,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 21 [2025-02-07 20:21:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608483636] [2025-02-07 20:21:39,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:39,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 20:21:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:39,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 20:21:39,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:21:39,619 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:21:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:40,302 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2025-02-07 20:21:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 20:21:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-02-07 20:21:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:40,303 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:21:40,303 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 20:21:40,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=3542, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:21:40,305 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:40,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 210 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:21:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 20:21:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-07 20:21:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:21:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-02-07 20:21:40,322 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 25 [2025-02-07 20:21:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-02-07 20:21:40,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:21:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-02-07 20:21:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-07 20:21:40,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:40,324 INFO L218 NwaCegarLoop]: trace histogram [44, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:40,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:21:40,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:40,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:40,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 311115237, now seen corresponding path program 2 times [2025-02-07 20:21:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410425626] [2025-02-07 20:21:40,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:40,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-07 20:21:40,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-07 20:21:40,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 444 proven. 66 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-02-07 20:21:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410425626] [2025-02-07 20:21:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410425626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971638656] [2025-02-07 20:21:40,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:21:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:40,793 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-02-07 20:21:40,795 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-02-07 20:21:40,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-07 20:21:40,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-07 20:21:40,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:21:40,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:40,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 20:21:40,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 8 proven. 931 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-07 20:21:41,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 43 proven. 896 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-07 20:21:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971638656] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:41,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2025-02-07 20:21:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17118943] [2025-02-07 20:21:41,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:41,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 20:21:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:41,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 20:21:41,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 20:21:41,456 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:21:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:45,117 INFO L93 Difference]: Finished difference Result 252 states and 298 transitions. [2025-02-07 20:21:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-02-07 20:21:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 83 [2025-02-07 20:21:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:45,119 INFO L225 Difference]: With dead ends: 252 [2025-02-07 20:21:45,119 INFO L226 Difference]: Without dead ends: 177 [2025-02-07 20:21:45,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8825 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3165, Invalid=21327, Unknown=0, NotChecked=0, Total=24492 [2025-02-07 20:21:45,126 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 112 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:45,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 402 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:21:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-07 20:21:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-07 20:21:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 163 states have internal predecessors, (175), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:21:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2025-02-07 20:21:45,151 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 83 [2025-02-07 20:21:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2025-02-07 20:21:45,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:21:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2025-02-07 20:21:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-07 20:21:45,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:45,158 INFO L218 NwaCegarLoop]: trace histogram [120, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:45,164 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-02-07 20:21:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:21:45,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:45,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash 150146025, now seen corresponding path program 3 times [2025-02-07 20:21:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989288540] [2025-02-07 20:21:45,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:45,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 207 statements into 35 equivalence classes. [2025-02-07 20:21:45,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 47 of 207 statements. [2025-02-07 20:21:45,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-07 20:21:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1569 proven. 78 refuted. 0 times theorem prover too weak. 7083 trivial. 0 not checked. [2025-02-07 20:21:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989288540] [2025-02-07 20:21:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989288540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806326076] [2025-02-07 20:21:45,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:21:45,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:45,583 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-02-07 20:21:45,587 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-02-07 20:21:45,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 207 statements into 35 equivalence classes. [2025-02-07 20:21:45,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 47 of 207 statements. [2025-02-07 20:21:45,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-07 20:21:45,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:45,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-07 20:21:45,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1447 proven. 1548 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2025-02-07 20:21:45,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1569 proven. 78 refuted. 0 times theorem prover too weak. 7083 trivial. 0 not checked. [2025-02-07 20:21:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806326076] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:45,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-02-07 20:21:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686242419] [2025-02-07 20:21:45,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 20:21:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:45,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 20:21:45,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:21:45,993 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:21:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:21:50,702 INFO L93 Difference]: Finished difference Result 492 states and 674 transitions. [2025-02-07 20:21:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 20:21:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 207 [2025-02-07 20:21:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:21:50,704 INFO L225 Difference]: With dead ends: 492 [2025-02-07 20:21:50,704 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 20:21:50,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=598, Invalid=1042, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 20:21:50,705 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:21:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:21:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 20:21:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-02-07 20:21:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 302 states have (on average 1.0430463576158941) internal successors, (315), 303 states have internal predecessors, (315), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:21:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 338 transitions. [2025-02-07 20:21:50,742 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 338 transitions. Word has length 207 [2025-02-07 20:21:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:21:50,743 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 338 transitions. [2025-02-07 20:21:50,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:21:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 338 transitions. [2025-02-07 20:21:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-07 20:21:50,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:21:50,746 INFO L218 NwaCegarLoop]: trace histogram [260, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-07 20:21:50,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:21:50,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:50,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:21:50,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:21:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash 528700265, now seen corresponding path program 4 times [2025-02-07 20:21:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:21:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312709675] [2025-02-07 20:21:50,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:21:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:21:50,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 347 statements into 2 equivalence classes. [2025-02-07 20:21:51,120 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 347 of 347 statements. [2025-02-07 20:21:51,121 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:21:51,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 6591 proven. 351 refuted. 0 times theorem prover too weak. 29718 trivial. 0 not checked. [2025-02-07 20:21:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:21:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312709675] [2025-02-07 20:21:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312709675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:21:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425090764] [2025-02-07 20:21:52,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:21:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:21:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:21:52,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:21:52,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:21:52,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 347 statements into 2 equivalence classes. [2025-02-07 20:21:52,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 347 of 347 statements. [2025-02-07 20:21:52,680 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:21:52,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:21:52,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 20:21:52,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:21:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 20 proven. 33181 refuted. 0 times theorem prover too weak. 3459 trivial. 0 not checked. [2025-02-07 20:21:53,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:21:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 196 proven. 33005 refuted. 0 times theorem prover too weak. 3459 trivial. 0 not checked. [2025-02-07 20:21:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425090764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:21:54,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:21:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 73 [2025-02-07 20:21:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958954442] [2025-02-07 20:21:54,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:21:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-07 20:21:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:21:54,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-07 20:21:54,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=4559, Unknown=0, NotChecked=0, Total=5256 [2025-02-07 20:21:54,906 INFO L87 Difference]: Start difference. First operand 317 states and 338 transitions. Second operand has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 21 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)