./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/nested_delay_nd.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 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:56:22,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:56:22,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:56:22,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:56:22,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:56:22,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:56:22,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:56:22,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:56:22,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:56:22,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:56:22,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:56:22,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:56:22,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:56:22,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:56:22,594 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:56:22,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:56:22,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:56:22,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:56:22,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:56:22,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:56:22,596 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 -> 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c [2025-02-05 14:56:22,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:56:22,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:56:22,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:56:22,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:56:22,839 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:56:22,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2025-02-05 14:56:23,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7de754e9/de2a05c9155e4b419f8add472bf0573d/FLAG59774d38f [2025-02-05 14:56:24,149 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:56:24,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2025-02-05 14:56:24,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7de754e9/de2a05c9155e4b419f8add472bf0573d/FLAG59774d38f [2025-02-05 14:56:24,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7de754e9/de2a05c9155e4b419f8add472bf0573d [2025-02-05 14:56:24,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:56:24,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:56:24,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:56:24,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:56:24,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:56:24,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f226b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24, skipping insertion in model container [2025-02-05 14:56:24,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:56:24,290 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/nested_delay_nd.c[465,478] [2025-02-05 14:56:24,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:56:24,310 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:56:24,317 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/nested_delay_nd.c[465,478] [2025-02-05 14:56:24,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:56:24,335 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:56:24,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24 WrapperNode [2025-02-05 14:56:24,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:56:24,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:56:24,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:56:24,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:56:24,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,358 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-02-05 14:56:24,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:56:24,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:56:24,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:56:24,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:56:24,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,375 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-05 14:56:24,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:56:24,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:56:24,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:56:24,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:56:24,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (1/1) ... [2025-02-05 14:56:24,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:56:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:24,412 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-05 14:56:24,414 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-05 14:56:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:56:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:56:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:56:24,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:56:24,474 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:56:24,476 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:56:24,614 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 14:56:24,614 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:56:24,620 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:56:24,620 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:56:24,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:56:24 BoogieIcfgContainer [2025-02-05 14:56:24,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:56:24,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:56:24,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:56:24,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:56:24,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:56:24" (1/3) ... [2025-02-05 14:56:24,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5978c9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:56:24, skipping insertion in model container [2025-02-05 14:56:24,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:56:24" (2/3) ... [2025-02-05 14:56:24,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5978c9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:56:24, skipping insertion in model container [2025-02-05 14:56:24,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:56:24" (3/3) ... [2025-02-05 14:56:24,631 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2025-02-05 14:56:24,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:56:24,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_delay_nd.c that has 1 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:56:24,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:56:24,699 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;@538f644d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:56:24,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:56:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:56:24,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:24,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:24,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 950394200, now seen corresponding path program 1 times [2025-02-05 14:56:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264957103] [2025-02-05 14:56:24,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:24,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:56:24,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:56:24,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:24,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:24,823 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-05 14:56:24,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264957103] [2025-02-05 14:56:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264957103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:56:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340354061] [2025-02-05 14:56:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:56:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:24,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:56:24,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:56:24,843 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:24,851 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2025-02-05 14:56:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:56:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:56:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:24,856 INFO L225 Difference]: With dead ends: 34 [2025-02-05 14:56:24,856 INFO L226 Difference]: Without dead ends: 17 [2025-02-05 14:56:24,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:56:24,861 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:24,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-05 14:56:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-05 14:56:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-02-05 14:56:24,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2025-02-05 14:56:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:24,882 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-02-05 14:56:24,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-02-05 14:56:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:56:24,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:24,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:24,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:56:24,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 753880695, now seen corresponding path program 1 times [2025-02-05 14:56:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163350050] [2025-02-05 14:56:24,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:56:24,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:56:24,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:25,008 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-05 14:56:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163350050] [2025-02-05 14:56:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163350050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:25,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:25,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127468501] [2025-02-05 14:56:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:56:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:25,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:56:25,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:56:25,012 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:25,072 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-02-05 14:56:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:56:25,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:56:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:25,073 INFO L225 Difference]: With dead ends: 33 [2025-02-05 14:56:25,073 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 14:56:25,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:56:25,074 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:25,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 14:56:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-05 14:56:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-02-05 14:56:25,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2025-02-05 14:56:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:25,081 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-05 14:56:25,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-02-05 14:56:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:56:25,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:25,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:56:25,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:25,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash -617869227, now seen corresponding path program 1 times [2025-02-05 14:56:25,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694771227] [2025-02-05 14:56:25,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:56:25,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:56:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:56:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694771227] [2025-02-05 14:56:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694771227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576954802] [2025-02-05 14:56:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:25,156 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:25,189 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2025-02-05 14:56:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:56:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:25,190 INFO L225 Difference]: With dead ends: 36 [2025-02-05 14:56:25,190 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 14:56:25,190 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-05 14:56:25,191 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:25,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 14:56:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-02-05 14:56:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-02-05 14:56:25,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2025-02-05 14:56:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:25,194 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-05 14:56:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-02-05 14:56:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:56:25,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:25,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:25,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:56:25,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:25,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash -589240076, now seen corresponding path program 1 times [2025-02-05 14:56:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872705894] [2025-02-05 14:56:25,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:25,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:56:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:56:25,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:56:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872705894] [2025-02-05 14:56:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872705894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838696588] [2025-02-05 14:56:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:25,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:56:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:25,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:56:25,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:56:25,316 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:25,343 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-02-05 14:56:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:56:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:56:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:25,345 INFO L225 Difference]: With dead ends: 49 [2025-02-05 14:56:25,345 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:56:25,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:56:25,346 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:25,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:56:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-05 14:56:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-02-05 14:56:25,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2025-02-05 14:56:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-02-05 14:56:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2025-02-05 14:56:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 14:56:25,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:25,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:56:25,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -589210285, now seen corresponding path program 1 times [2025-02-05 14:56:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001687996] [2025-02-05 14:56:25,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:25,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:56:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:56:25,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:25,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:25,428 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-05 14:56:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001687996] [2025-02-05 14:56:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001687996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116364949] [2025-02-05 14:56:25,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:25,431 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-05 14:56:25,433 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-05 14:56:25,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 14:56:25,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 14:56:25,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:25,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:25,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:56:25,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:25,544 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-05 14:56:25,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:25,578 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-05 14:56:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116364949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:25,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-05 14:56:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026001607] [2025-02-05 14:56:25,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:56:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:56:25,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:56:25,580 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:25,677 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2025-02-05 14:56:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:56:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 14:56:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:25,679 INFO L225 Difference]: With dead ends: 78 [2025-02-05 14:56:25,679 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 14:56:25,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:56:25,681 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:25,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 14:56:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-05 14:56:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2025-02-05 14:56:25,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2025-02-05 14:56:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2025-02-05 14:56:25,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2025-02-05 14:56:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:56:25,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:25,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:25,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:56:25,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:25,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:25,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1544667637, now seen corresponding path program 2 times [2025-02-05 14:56:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738259336] [2025-02-05 14:56:25,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:25,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:56:25,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:56:25,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:25,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:56:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738259336] [2025-02-05 14:56:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738259336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478940682] [2025-02-05 14:56:26,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:26,034 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-05 14:56:26,035 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-05 14:56:26,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-05 14:56:26,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:56:26,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:26,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:56:26,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:56:26,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:56:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478940682] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:26,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-02-05 14:56:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560762246] [2025-02-05 14:56:26,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 14:56:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:26,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 14:56:26,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:56:26,231 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:26,456 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2025-02-05 14:56:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:56:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 14:56:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:26,457 INFO L225 Difference]: With dead ends: 169 [2025-02-05 14:56:26,457 INFO L226 Difference]: Without dead ends: 123 [2025-02-05 14:56:26,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-02-05 14:56:26,458 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 96 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:26,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 100 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-05 14:56:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2025-02-05 14:56:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-02-05 14:56:26,469 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 24 [2025-02-05 14:56:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:26,469 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-02-05 14:56:26,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-02-05 14:56:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:56:26,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:26,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:26,475 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-05 14:56:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:26,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 376775349, now seen corresponding path program 1 times [2025-02-05 14:56:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15170571] [2025-02-05 14:56:26,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:56:26,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:56:26,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:26,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 14:56:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15170571] [2025-02-05 14:56:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15170571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506617465] [2025-02-05 14:56:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:26,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:26,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:26,704 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:26,721 INFO L93 Difference]: Finished difference Result 241 states and 315 transitions. [2025-02-05 14:56:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 14:56:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:26,722 INFO L225 Difference]: With dead ends: 241 [2025-02-05 14:56:26,723 INFO L226 Difference]: Without dead ends: 133 [2025-02-05 14:56:26,723 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-05 14:56:26,723 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:26,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-05 14:56:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2025-02-05 14:56:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2025-02-05 14:56:26,738 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 24 [2025-02-05 14:56:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2025-02-05 14:56:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2025-02-05 14:56:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:56:26,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:26,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:56:26,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:26,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 727822736, now seen corresponding path program 1 times [2025-02-05 14:56:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:26,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48082442] [2025-02-05 14:56:26,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:26,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:26,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:56:26,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:56:26,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:26,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:56:26,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:26,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48082442] [2025-02-05 14:56:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48082442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:56:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084967845] [2025-02-05 14:56:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:26,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:56:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:56:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:56:26,801 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:26,818 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-02-05 14:56:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:56:26,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:56:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:26,820 INFO L225 Difference]: With dead ends: 165 [2025-02-05 14:56:26,820 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 14:56:26,820 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-05 14:56:26,821 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:26,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 14:56:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 14:56:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 111 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-02-05 14:56:26,849 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 25 [2025-02-05 14:56:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-02-05 14:56:26,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-02-05 14:56:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:56:26,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:26,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:26,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:56:26,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:26,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash 728776048, now seen corresponding path program 1 times [2025-02-05 14:56:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321145969] [2025-02-05 14:56:26,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:26,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:56:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:56:26,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321145969] [2025-02-05 14:56:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321145969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666529672] [2025-02-05 14:56:26,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:26,929 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-05 14:56:26,931 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-05 14:56:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:56:26,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:56:26,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:26,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:26,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:56:26,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:27,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666529672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:27,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-05 14:56:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130261217] [2025-02-05 14:56:27,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 14:56:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:27,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 14:56:27,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:56:27,132 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:27,255 INFO L93 Difference]: Finished difference Result 328 states and 442 transitions. [2025-02-05 14:56:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:56:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:56:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:27,256 INFO L225 Difference]: With dead ends: 328 [2025-02-05 14:56:27,256 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 14:56:27,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-02-05 14:56:27,257 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:27,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 24 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 14:56:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-05 14:56:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 219 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2025-02-05 14:56:27,278 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 25 [2025-02-05 14:56:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:27,278 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2025-02-05 14:56:27,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2025-02-05 14:56:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:56:27,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:27,281 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:27,287 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-05 14:56:27,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:27,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 472089520, now seen corresponding path program 2 times [2025-02-05 14:56:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940787461] [2025-02-05 14:56:27,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:27,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 14:56:27,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:56:27,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940787461] [2025-02-05 14:56:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940787461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354218742] [2025-02-05 14:56:27,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:27,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:27,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:27,636 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-05 14:56:27,638 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-05 14:56:27,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 14:56:27,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:56:27,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:27,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:27,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 14:56:27,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:27,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:56:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354218742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:28,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-05 14:56:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525923634] [2025-02-05 14:56:28,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 14:56:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:28,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 14:56:28,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 14:56:28,081 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:28,394 INFO L93 Difference]: Finished difference Result 652 states and 874 transitions. [2025-02-05 14:56:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 14:56:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 14:56:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:28,396 INFO L225 Difference]: With dead ends: 652 [2025-02-05 14:56:28,396 INFO L226 Difference]: Without dead ends: 436 [2025-02-05 14:56:28,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 14:56:28,398 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:28,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 48 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:56:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-05 14:56:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-02-05 14:56:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.2298850574712643) internal successors, (535), 435 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 535 transitions. [2025-02-05 14:56:28,438 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 535 transitions. Word has length 43 [2025-02-05 14:56:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:28,438 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 535 transitions. [2025-02-05 14:56:28,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 535 transitions. [2025-02-05 14:56:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 14:56:28,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:28,441 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:28,447 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-05 14:56:28,641 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,SelfDestructingSolverStorable9 [2025-02-05 14:56:28,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 140959792, now seen corresponding path program 3 times [2025-02-05 14:56:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981848465] [2025-02-05 14:56:28,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:56:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:28,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 23 equivalence classes. [2025-02-05 14:56:28,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 79 statements. [2025-02-05 14:56:28,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 14:56:28,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-02-05 14:56:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981848465] [2025-02-05 14:56:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981848465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 14:56:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047790899] [2025-02-05 14:56:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 14:56:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:28,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 14:56:28,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:56:28,775 INFO L87 Difference]: Start difference. First operand 436 states and 535 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:28,850 INFO L93 Difference]: Finished difference Result 651 states and 800 transitions. [2025-02-05 14:56:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:56:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 14:56:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:28,856 INFO L225 Difference]: With dead ends: 651 [2025-02-05 14:56:28,856 INFO L226 Difference]: Without dead ends: 649 [2025-02-05 14:56:28,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:56:28,856 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:28,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-05 14:56:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-02-05 14:56:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.228395061728395) internal successors, (796), 648 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 796 transitions. [2025-02-05 14:56:28,892 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 796 transitions. Word has length 79 [2025-02-05 14:56:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:28,892 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 796 transitions. [2025-02-05 14:56:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 796 transitions. [2025-02-05 14:56:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 14:56:28,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:28,893 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 14:56:28,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -375951312, now seen corresponding path program 1 times [2025-02-05 14:56:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614896506] [2025-02-05 14:56:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 14:56:28,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 14:56:28,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:28,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-02-05 14:56:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614896506] [2025-02-05 14:56:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614896506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:56:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013641967] [2025-02-05 14:56:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:56:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:28,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:56:28,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:56:28,990 INFO L87 Difference]: Start difference. First operand 649 states and 796 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:29,059 INFO L93 Difference]: Finished difference Result 1085 states and 1331 transitions. [2025-02-05 14:56:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:56:29,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 14:56:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:29,062 INFO L225 Difference]: With dead ends: 1085 [2025-02-05 14:56:29,062 INFO L226 Difference]: Without dead ends: 868 [2025-02-05 14:56:29,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:56:29,063 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:29,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-02-05 14:56:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 789. [2025-02-05 14:56:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.2461928934010151) internal successors, (982), 788 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 982 transitions. [2025-02-05 14:56:29,100 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 982 transitions. Word has length 79 [2025-02-05 14:56:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 982 transitions. [2025-02-05 14:56:29,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 982 transitions. [2025-02-05 14:56:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 14:56:29,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:29,102 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 14:56:29,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1780522402, now seen corresponding path program 1 times [2025-02-05 14:56:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502606621] [2025-02-05 14:56:29,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:29,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 14:56:29,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 14:56:29,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:29,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 14:56:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502606621] [2025-02-05 14:56:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502606621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646354031] [2025-02-05 14:56:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:29,729 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-05 14:56:29,731 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-05 14:56:29,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 14:56:29,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 14:56:29,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:29,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:29,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 14:56:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 14:56:30,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 14:56:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646354031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:31,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-02-05 14:56:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137122825] [2025-02-05 14:56:31,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:31,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-05 14:56:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-05 14:56:31,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 14:56:31,076 INFO L87 Difference]: Start difference. First operand 789 states and 982 transitions. Second operand has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:31,992 INFO L93 Difference]: Finished difference Result 2171 states and 2968 transitions. [2025-02-05 14:56:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 14:56:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-02-05 14:56:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:31,997 INFO L225 Difference]: With dead ends: 2171 [2025-02-05 14:56:31,998 INFO L226 Difference]: Without dead ends: 1581 [2025-02-05 14:56:32,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:56:32,002 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 399 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:32,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 54 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:56:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-02-05 14:56:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2025-02-05 14:56:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.2443037974683544) internal successors, (1966), 1580 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1966 transitions. [2025-02-05 14:56:32,055 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1966 transitions. Word has length 154 [2025-02-05 14:56:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:32,055 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 1966 transitions. [2025-02-05 14:56:32,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1966 transitions. [2025-02-05 14:56:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 14:56:32,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:32,076 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:32,093 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-05 14:56:32,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 14:56:32,277 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1888756830, now seen corresponding path program 2 times [2025-02-05 14:56:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329347656] [2025-02-05 14:56:32,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:32,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-02-05 14:56:32,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 14:56:32,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:32,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 12565 trivial. 0 not checked. [2025-02-05 14:56:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329347656] [2025-02-05 14:56:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329347656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:56:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243752736] [2025-02-05 14:56:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:56:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:56:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:56:32,502 INFO L87 Difference]: Start difference. First operand 1581 states and 1966 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:32,551 INFO L93 Difference]: Finished difference Result 1583 states and 1967 transitions. [2025-02-05 14:56:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:56:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-02-05 14:56:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:32,555 INFO L225 Difference]: With dead ends: 1583 [2025-02-05 14:56:32,555 INFO L226 Difference]: Without dead ends: 1144 [2025-02-05 14:56:32,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:56:32,556 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:32,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:56:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-02-05 14:56:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-02-05 14:56:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.3289588801399825) internal successors, (1519), 1143 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1519 transitions. [2025-02-05 14:56:32,598 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1519 transitions. Word has length 298 [2025-02-05 14:56:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1519 transitions. [2025-02-05 14:56:32,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1519 transitions. [2025-02-05 14:56:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 14:56:32,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:32,601 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 90, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 14:56:32,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:32,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash 154887074, now seen corresponding path program 1 times [2025-02-05 14:56:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:32,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766066459] [2025-02-05 14:56:32,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:32,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 14:56:32,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 14:56:32,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-02-05 14:56:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766066459] [2025-02-05 14:56:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766066459] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386966708] [2025-02-05 14:56:34,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:34,343 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-05 14:56:34,345 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-05 14:56:34,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 14:56:34,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 14:56:34,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:34,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:34,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 14:56:34,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-02-05 14:56:35,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:56:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-02-05 14:56:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386966708] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:56:37,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:56:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 144 [2025-02-05 14:56:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536652856] [2025-02-05 14:56:37,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:56:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-02-05 14:56:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-02-05 14:56:37,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-02-05 14:56:37,804 INFO L87 Difference]: Start difference. First operand 1144 states and 1519 transitions. Second operand has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:40,523 INFO L93 Difference]: Finished difference Result 3162 states and 4589 transitions. [2025-02-05 14:56:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-02-05 14:56:40,524 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-02-05 14:56:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:40,530 INFO L225 Difference]: With dead ends: 3162 [2025-02-05 14:56:40,530 INFO L226 Difference]: Without dead ends: 2296 [2025-02-05 14:56:40,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-02-05 14:56:40,537 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 867 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:40,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 48 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:56:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-02-05 14:56:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2025-02-05 14:56:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.3311546840958606) internal successors, (3055), 2295 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3055 transitions. [2025-02-05 14:56:40,623 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3055 transitions. Word has length 298 [2025-02-05 14:56:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3055 transitions. [2025-02-05 14:56:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3055 transitions. [2025-02-05 14:56:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-02-05 14:56:40,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:40,630 INFO L218 NwaCegarLoop]: trace histogram [188, 188, 186, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:40,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:56:40,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 14:56:40,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1682218914, now seen corresponding path program 2 times [2025-02-05 14:56:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:40,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926704149] [2025-02-05 14:56:40,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:56:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:40,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 586 statements into 2 equivalence classes. [2025-02-05 14:56:40,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 586 of 586 statements. [2025-02-05 14:56:40,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:56:40,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 39904 proven. 0 refuted. 0 times theorem prover too weak. 13214 trivial. 0 not checked. [2025-02-05 14:56:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926704149] [2025-02-05 14:56:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926704149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:56:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:56:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2025-02-05 14:56:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903083646] [2025-02-05 14:56:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:56:45,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-05 14:56:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:56:45,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-05 14:56:45,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:56:45,739 INFO L87 Difference]: Start difference. First operand 2296 states and 3055 transitions. Second operand has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:56:49,497 INFO L93 Difference]: Finished difference Result 57119 states and 76118 transitions. [2025-02-05 14:56:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-05 14:56:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586 [2025-02-05 14:56:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:56:49,610 INFO L225 Difference]: With dead ends: 57119 [2025-02-05 14:56:49,610 INFO L226 Difference]: Without dead ends: 55120 [2025-02-05 14:56:49,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:56:49,626 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2374 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:56:49,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 238 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:56:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55120 states. [2025-02-05 14:56:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55120 to 2308. [2025-02-05 14:56:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.1716514954486346) internal successors, (2703), 2307 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2703 transitions. [2025-02-05 14:56:50,342 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2703 transitions. Word has length 586 [2025-02-05 14:56:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:56:50,343 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 2703 transitions. [2025-02-05 14:56:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:56:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2703 transitions. [2025-02-05 14:56:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-02-05 14:56:50,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:56:50,351 INFO L218 NwaCegarLoop]: trace histogram [188, 188, 186, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:56:50,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 14:56:50,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:56:50,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:56:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 925773826, now seen corresponding path program 1 times [2025-02-05 14:56:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:56:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43873273] [2025-02-05 14:56:50,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:56:50,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-02-05 14:56:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-02-05 14:56:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-02-05 14:56:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:56:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43873273] [2025-02-05 14:56:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43873273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:56:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31156447] [2025-02-05 14:56:55,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:56:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:56:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:56:55,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:56:55,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:56:55,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-02-05 14:56:55,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-02-05 14:56:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:56:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:56:55,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 14:56:55,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:56:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-02-05 14:56:58,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:57:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-02-05 14:57:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31156447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:57:06,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:57:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 288 [2025-02-05 14:57:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421063270] [2025-02-05 14:57:06,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:57:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2025-02-05 14:57:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:57:06,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2025-02-05 14:57:06,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36867, Invalid=46365, Unknown=0, NotChecked=0, Total=83232 [2025-02-05 14:57:06,554 INFO L87 Difference]: Start difference. First operand 2308 states and 2703 transitions. Second operand has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:57:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:57:20,532 INFO L93 Difference]: Finished difference Result 7120 states and 9350 transitions. [2025-02-05 14:57:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-02-05 14:57:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586 [2025-02-05 14:57:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:57:20,541 INFO L225 Difference]: With dead ends: 7120 [2025-02-05 14:57:20,541 INFO L226 Difference]: Without dead ends: 5380 [2025-02-05 14:57:20,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1362 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54337 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=55392, Invalid=91680, Unknown=0, NotChecked=0, Total=147072 [2025-02-05 14:57:20,547 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1803 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:57:20,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 78 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:57:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2025-02-05 14:57:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4612. [2025-02-05 14:57:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.1691607026675341) internal successors, (5391), 4611 states have internal predecessors, (5391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:57:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5391 transitions. [2025-02-05 14:57:21,556 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5391 transitions. Word has length 586 [2025-02-05 14:57:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:57:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 5391 transitions. [2025-02-05 14:57:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:57:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5391 transitions. [2025-02-05 14:57:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1163 [2025-02-05 14:57:21,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:57:21,566 INFO L218 NwaCegarLoop]: trace histogram [380, 380, 378, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:57:21,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 14:57:21,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:57:21,767 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:57:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:57:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1446867966, now seen corresponding path program 2 times [2025-02-05 14:57:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:57:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301277169] [2025-02-05 14:57:21,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:57:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:57:21,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-02-05 14:57:22,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-02-05 14:57:22,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:57:22,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:57:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 216798 backedges. 108682 proven. 54055 refuted. 0 times theorem prover too weak. 54061 trivial. 0 not checked. [2025-02-05 14:57:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:57:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301277169] [2025-02-05 14:57:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301277169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:57:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000349689] [2025-02-05 14:57:43,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:57:43,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:57:43,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:57:43,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:57:43,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:57:43,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-02-05 14:57:43,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-02-05 14:57:43,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:57:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:57:43,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 193 conjuncts are in the unsatisfiable core [2025-02-05 14:57:43,817 INFO L279 TraceCheckSpWp]: Computing forward predicates...