./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label47.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/eca-rers2012/Problem03_label47.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 c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:48:09,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:48:10,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:48:10,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:48:10,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:48:10,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:48:10,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:48:10,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:48:10,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:48:10,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:48:10,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:48:10,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:48:10,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:48:10,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:48:10,045 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:48:10,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:48:10,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:48:10,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:48:10,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:48:10,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:48:10,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:48:10,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:48:10,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:48:10,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:48:10,048 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 -> c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 [2025-02-05 10:48:10,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:48:10,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:48:10,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:48:10,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:48:10,280 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:48:10,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2025-02-05 10:48:11,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1861e66b/f00051aeff824f47aa16fb593692eb9a/FLAG9c7ffc675 [2025-02-05 10:48:11,761 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:48:11,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2025-02-05 10:48:11,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1861e66b/f00051aeff824f47aa16fb593692eb9a/FLAG9c7ffc675 [2025-02-05 10:48:11,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1861e66b/f00051aeff824f47aa16fb593692eb9a [2025-02-05 10:48:11,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:48:11,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:48:11,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:48:11,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:48:11,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:48:11,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:11" (1/1) ... [2025-02-05 10:48:11,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccebb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:11, skipping insertion in model container [2025-02-05 10:48:11,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:11" (1/1) ... [2025-02-05 10:48:12,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:48:12,442 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/eca-rers2012/Problem03_label47.c[60825,60838] [2025-02-05 10:48:12,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:48:12,477 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:48:12,622 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/eca-rers2012/Problem03_label47.c[60825,60838] [2025-02-05 10:48:12,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:48:12,649 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:48:12,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12 WrapperNode [2025-02-05 10:48:12,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:48:12,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:48:12,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:48:12,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:48:12,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,773 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:48:12,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:48:12,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:48:12,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:48:12,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:48:12,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,846 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 10:48:12,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:48:12,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:48:12,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:48:12,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:48:12,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (1/1) ... [2025-02-05 10:48:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:48:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:12,995 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 10:48:13,001 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 10:48:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:48:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:48:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:48:13,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:48:13,080 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:48:13,082 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:48:14,451 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:48:14,451 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:48:14,472 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:48:14,475 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:48:14,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:14 BoogieIcfgContainer [2025-02-05 10:48:14,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:48:14,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:48:14,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:48:14,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:48:14,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:48:11" (1/3) ... [2025-02-05 10:48:14,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2151ffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:14, skipping insertion in model container [2025-02-05 10:48:14,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:12" (2/3) ... [2025-02-05 10:48:14,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2151ffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:14, skipping insertion in model container [2025-02-05 10:48:14,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:14" (3/3) ... [2025-02-05 10:48:14,484 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label47.c [2025-02-05 10:48:14,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:48:14,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label47.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:48:14,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:48:14,563 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;@6d2b2cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:48:14,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:48:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 10:48:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 10:48:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:14,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:14,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 235835993, now seen corresponding path program 1 times [2025-02-05 10:48:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809291264] [2025-02-05 10:48:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:14,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 10:48:14,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 10:48:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:15,364 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 10:48:15,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809291264] [2025-02-05 10:48:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809291264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:48:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311414715] [2025-02-05 10:48:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:15,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:15,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:15,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:15,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:15,392 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 10:48:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:16,267 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-02-05 10:48:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 197 [2025-02-05 10:48:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:16,276 INFO L225 Difference]: With dead ends: 860 [2025-02-05 10:48:16,276 INFO L226 Difference]: Without dead ends: 465 [2025-02-05 10:48:16,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:48:16,280 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 107 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:16,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:48:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-02-05 10:48:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-02-05 10:48:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 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 10:48:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-02-05 10:48:16,326 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 197 [2025-02-05 10:48:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:16,327 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-02-05 10:48:16,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 10:48:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-02-05 10:48:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 10:48:16,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:16,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:16,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:48:16,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2129013565, now seen corresponding path program 1 times [2025-02-05 10:48:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:16,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998946367] [2025-02-05 10:48:16,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 10:48:16,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 10:48:16,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998946367] [2025-02-05 10:48:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998946367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:16,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:48:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247880962] [2025-02-05 10:48:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:16,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:16,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:16,518 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 10:48:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:17,185 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-02-05 10:48:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 205 [2025-02-05 10:48:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:17,189 INFO L225 Difference]: With dead ends: 1343 [2025-02-05 10:48:17,189 INFO L226 Difference]: Without dead ends: 886 [2025-02-05 10:48:17,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:48:17,190 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:17,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-05 10:48:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-02-05 10:48:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 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 10:48:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2025-02-05 10:48:17,223 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 205 [2025-02-05 10:48:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:17,223 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2025-02-05 10:48:17,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 10:48:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2025-02-05 10:48:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 10:48:17,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:17,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:48:17,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -966494535, now seen corresponding path program 1 times [2025-02-05 10:48:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335632100] [2025-02-05 10:48:17,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:17,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 10:48:17,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 10:48:17,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:17,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335632100] [2025-02-05 10:48:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335632100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:48:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16460158] [2025-02-05 10:48:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:17,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:17,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:17,496 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 10:48:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:18,164 INFO L93 Difference]: Finished difference Result 2546 states and 3911 transitions. [2025-02-05 10:48:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:18,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 206 [2025-02-05 10:48:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:18,172 INFO L225 Difference]: With dead ends: 2546 [2025-02-05 10:48:18,172 INFO L226 Difference]: Without dead ends: 1680 [2025-02-05 10:48:18,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:48:18,175 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 213 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:18,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 192 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-02-05 10:48:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1680. [2025-02-05 10:48:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1679 states have (on average 1.3442525312686122) internal successors, (2257), 1679 states have internal predecessors, (2257), 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 10:48:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2257 transitions. [2025-02-05 10:48:18,212 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2257 transitions. Word has length 206 [2025-02-05 10:48:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2257 transitions. [2025-02-05 10:48:18,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 10:48:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2257 transitions. [2025-02-05 10:48:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 10:48:18,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:18,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:48:18,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2047373171, now seen corresponding path program 1 times [2025-02-05 10:48:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117180859] [2025-02-05 10:48:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 10:48:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 10:48:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117180859] [2025-02-05 10:48:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117180859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:48:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119461601] [2025-02-05 10:48:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:18,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:18,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:18,503 INFO L87 Difference]: Start difference. First operand 1680 states and 2257 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 10:48:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:19,231 INFO L93 Difference]: Finished difference Result 5010 states and 6731 transitions. [2025-02-05 10:48:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 209 [2025-02-05 10:48:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:19,240 INFO L225 Difference]: With dead ends: 5010 [2025-02-05 10:48:19,241 INFO L226 Difference]: Without dead ends: 3332 [2025-02-05 10:48:19,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:48:19,246 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:19,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:48:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2025-02-05 10:48:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3329. [2025-02-05 10:48:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3328 states have (on average 1.3209134615384615) internal successors, (4396), 3328 states have internal predecessors, (4396), 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 10:48:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4396 transitions. [2025-02-05 10:48:19,299 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4396 transitions. Word has length 209 [2025-02-05 10:48:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:19,299 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 4396 transitions. [2025-02-05 10:48:19,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 10:48:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4396 transitions. [2025-02-05 10:48:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 10:48:19,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:19,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:48:19,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1893588766, now seen corresponding path program 1 times [2025-02-05 10:48:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770062993] [2025-02-05 10:48:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:19,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 10:48:19,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 10:48:19,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:19,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:48:19,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:19,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770062993] [2025-02-05 10:48:19,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770062993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:19,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:19,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31853696] [2025-02-05 10:48:19,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:19,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:48:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:19,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:48:19,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:48:19,753 INFO L87 Difference]: Start difference. First operand 3329 states and 4396 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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 10:48:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:20,518 INFO L93 Difference]: Finished difference Result 6980 states and 9329 transitions. [2025-02-05 10:48:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:48:20,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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 212 [2025-02-05 10:48:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:20,530 INFO L225 Difference]: With dead ends: 6980 [2025-02-05 10:48:20,530 INFO L226 Difference]: Without dead ends: 3305 [2025-02-05 10:48:20,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:48:20,535 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 332 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:20,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 47 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:48:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-02-05 10:48:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3305. [2025-02-05 10:48:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3304 states have (on average 1.2263922518159807) internal successors, (4052), 3304 states have internal predecessors, (4052), 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 10:48:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4052 transitions. [2025-02-05 10:48:20,604 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4052 transitions. Word has length 212 [2025-02-05 10:48:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:20,604 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4052 transitions. [2025-02-05 10:48:20,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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 10:48:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4052 transitions. [2025-02-05 10:48:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 10:48:20,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:20,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:20,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:48:20,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:20,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash -891771982, now seen corresponding path program 1 times [2025-02-05 10:48:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499388578] [2025-02-05 10:48:20,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:20,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:20,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 10:48:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 10:48:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:20,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499388578] [2025-02-05 10:48:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499388578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437321854] [2025-02-05 10:48:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:20,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:48:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:20,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:48:20,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:48:20,991 INFO L87 Difference]: Start difference. First operand 3305 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 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 10:48:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:21,879 INFO L93 Difference]: Finished difference Result 8602 states and 10616 transitions. [2025-02-05 10:48:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:48:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 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 228 [2025-02-05 10:48:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:21,893 INFO L225 Difference]: With dead ends: 8602 [2025-02-05 10:48:21,893 INFO L226 Difference]: Without dead ends: 4951 [2025-02-05 10:48:21,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:48:21,899 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 198 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:21,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:48:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-02-05 10:48:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4949. [2025-02-05 10:48:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4949 states, 4948 states have (on average 1.2162489894907034) internal successors, (6018), 4948 states have internal predecessors, (6018), 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 10:48:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 6018 transitions. [2025-02-05 10:48:21,970 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 6018 transitions. Word has length 228 [2025-02-05 10:48:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:21,971 INFO L471 AbstractCegarLoop]: Abstraction has 4949 states and 6018 transitions. [2025-02-05 10:48:21,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 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 10:48:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 6018 transitions. [2025-02-05 10:48:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 10:48:21,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:21,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:21,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:48:21,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:21,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 45556471, now seen corresponding path program 1 times [2025-02-05 10:48:21,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:21,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74875860] [2025-02-05 10:48:21,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:22,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 10:48:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 10:48:22,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:22,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74875860] [2025-02-05 10:48:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74875860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415892114] [2025-02-05 10:48:22,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:22,829 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 10:48:22,831 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 10:48:22,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 10:48:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 10:48:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:22,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:22,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 10:48:23,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415892114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:23,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788513181] [2025-02-05 10:48:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:23,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:23,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:23,175 INFO L87 Difference]: Start difference. First operand 4949 states and 6018 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 10:48:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:23,729 INFO L93 Difference]: Finished difference Result 9912 states and 12062 transitions. [2025-02-05 10:48:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 235 [2025-02-05 10:48:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:23,741 INFO L225 Difference]: With dead ends: 9912 [2025-02-05 10:48:23,742 INFO L226 Difference]: Without dead ends: 4965 [2025-02-05 10:48:23,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:23,748 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:23,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 321 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:48:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4965 states. [2025-02-05 10:48:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4965 to 4949. [2025-02-05 10:48:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4949 states, 4948 states have (on average 1.1996766370250607) internal successors, (5936), 4948 states have internal predecessors, (5936), 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 10:48:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 5936 transitions. [2025-02-05 10:48:23,823 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 5936 transitions. Word has length 235 [2025-02-05 10:48:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:23,823 INFO L471 AbstractCegarLoop]: Abstraction has 4949 states and 5936 transitions. [2025-02-05 10:48:23,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 10:48:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 5936 transitions. [2025-02-05 10:48:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 10:48:23,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:23,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:23,836 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 10:48:24,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:24,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1700327164, now seen corresponding path program 1 times [2025-02-05 10:48:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494410700] [2025-02-05 10:48:24,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 10:48:24,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 10:48:24,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:24,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:48:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494410700] [2025-02-05 10:48:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494410700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402035229] [2025-02-05 10:48:24,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:24,753 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 10:48:24,754 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 10:48:24,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 10:48:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 10:48:24,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:24,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:24,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:48:25,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402035229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884056674] [2025-02-05 10:48:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:25,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:25,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:25,074 INFO L87 Difference]: Start difference. First operand 4949 states and 5936 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 10:48:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:25,605 INFO L93 Difference]: Finished difference Result 12336 states and 15088 transitions. [2025-02-05 10:48:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:25,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 241 [2025-02-05 10:48:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:25,621 INFO L225 Difference]: With dead ends: 12336 [2025-02-05 10:48:25,621 INFO L226 Difference]: Without dead ends: 7389 [2025-02-05 10:48:25,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:25,627 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:25,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 334 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:48:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2025-02-05 10:48:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 7385. [2025-02-05 10:48:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7385 states, 7384 states have (on average 1.158450704225352) internal successors, (8554), 7384 states have internal predecessors, (8554), 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 10:48:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 8554 transitions. [2025-02-05 10:48:25,756 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 8554 transitions. Word has length 241 [2025-02-05 10:48:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:25,756 INFO L471 AbstractCegarLoop]: Abstraction has 7385 states and 8554 transitions. [2025-02-05 10:48:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 10:48:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 8554 transitions. [2025-02-05 10:48:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-05 10:48:25,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:25,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:25,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:48:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:25,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash -143587190, now seen corresponding path program 1 times [2025-02-05 10:48:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880855789] [2025-02-05 10:48:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:25,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 10:48:25,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 10:48:25,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880855789] [2025-02-05 10:48:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880855789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:48:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008288189] [2025-02-05 10:48:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:26,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:26,238 INFO L87 Difference]: Start difference. First operand 7385 states and 8554 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 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 10:48:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:26,668 INFO L93 Difference]: Finished difference Result 17435 states and 20134 transitions. [2025-02-05 10:48:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 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 260 [2025-02-05 10:48:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:26,689 INFO L225 Difference]: With dead ends: 17435 [2025-02-05 10:48:26,689 INFO L226 Difference]: Without dead ends: 10052 [2025-02-05 10:48:26,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:48:26,696 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 160 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:26,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 97 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10052 states. [2025-02-05 10:48:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10052 to 10044. [2025-02-05 10:48:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10044 states, 10043 states have (on average 1.1478641840087622) internal successors, (11528), 10043 states have internal predecessors, (11528), 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 10:48:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10044 states to 10044 states and 11528 transitions. [2025-02-05 10:48:26,808 INFO L78 Accepts]: Start accepts. Automaton has 10044 states and 11528 transitions. Word has length 260 [2025-02-05 10:48:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:26,808 INFO L471 AbstractCegarLoop]: Abstraction has 10044 states and 11528 transitions. [2025-02-05 10:48:26,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 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 10:48:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 10044 states and 11528 transitions. [2025-02-05 10:48:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-05 10:48:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:26,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:48:26,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 683226063, now seen corresponding path program 1 times [2025-02-05 10:48:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762977614] [2025-02-05 10:48:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:26,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 10:48:26,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 10:48:26,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762977614] [2025-02-05 10:48:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762977614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024632489] [2025-02-05 10:48:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:27,171 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 10:48:27,173 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 10:48:27,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-05 10:48:27,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-05 10:48:27,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:27,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:27,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:48:27,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:27,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024632489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:48:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685626385] [2025-02-05 10:48:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:27,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:27,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:27,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:48:27,467 INFO L87 Difference]: Start difference. First operand 10044 states and 11528 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 10:48:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:27,983 INFO L93 Difference]: Finished difference Result 27601 states and 31636 transitions. [2025-02-05 10:48:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 267 [2025-02-05 10:48:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:28,010 INFO L225 Difference]: With dead ends: 27601 [2025-02-05 10:48:28,010 INFO L226 Difference]: Without dead ends: 17559 [2025-02-05 10:48:28,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:48:28,017 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 153 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:28,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 127 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17559 states. [2025-02-05 10:48:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17559 to 17557. [2025-02-05 10:48:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17557 states, 17556 states have (on average 1.1181932102984735) internal successors, (19631), 17556 states have internal predecessors, (19631), 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 10:48:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17557 states to 17557 states and 19631 transitions. [2025-02-05 10:48:28,185 INFO L78 Accepts]: Start accepts. Automaton has 17557 states and 19631 transitions. Word has length 267 [2025-02-05 10:48:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:28,186 INFO L471 AbstractCegarLoop]: Abstraction has 17557 states and 19631 transitions. [2025-02-05 10:48:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 10:48:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 17557 states and 19631 transitions. [2025-02-05 10:48:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-02-05 10:48:28,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:28,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:28,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:48:28,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:28,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 754261393, now seen corresponding path program 1 times [2025-02-05 10:48:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509113816] [2025-02-05 10:48:28,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-05 10:48:28,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-05 10:48:28,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:28,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509113816] [2025-02-05 10:48:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509113816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384306612] [2025-02-05 10:48:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:28,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:28,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:28,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:28,551 INFO L87 Difference]: Start difference. First operand 17557 states and 19631 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:29,126 INFO L93 Difference]: Finished difference Result 45087 states and 50692 transitions. [2025-02-05 10:48:29,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-02-05 10:48:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:29,165 INFO L225 Difference]: With dead ends: 45087 [2025-02-05 10:48:29,165 INFO L226 Difference]: Without dead ends: 27532 [2025-02-05 10:48:29,181 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 10:48:29,181 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:29,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 317 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:48:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27532 states. [2025-02-05 10:48:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27532 to 27530. [2025-02-05 10:48:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27530 states, 27529 states have (on average 1.1049802026953395) internal successors, (30419), 27529 states have internal predecessors, (30419), 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 10:48:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27530 states to 27530 states and 30419 transitions. [2025-02-05 10:48:29,468 INFO L78 Accepts]: Start accepts. Automaton has 27530 states and 30419 transitions. Word has length 293 [2025-02-05 10:48:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:29,470 INFO L471 AbstractCegarLoop]: Abstraction has 27530 states and 30419 transitions. [2025-02-05 10:48:29,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27530 states and 30419 transitions. [2025-02-05 10:48:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-05 10:48:29,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:29,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:29,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:48:29,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:29,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1557701840, now seen corresponding path program 1 times [2025-02-05 10:48:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847194345] [2025-02-05 10:48:29,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:29,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-05 10:48:29,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-05 10:48:29,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:29,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847194345] [2025-02-05 10:48:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847194345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:48:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:48:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704177536] [2025-02-05 10:48:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:48:29,672 INFO L87 Difference]: Start difference. First operand 27530 states and 30419 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 10:48:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:30,209 INFO L93 Difference]: Finished difference Result 72116 states and 79829 transitions. [2025-02-05 10:48:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:30,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 320 [2025-02-05 10:48:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:30,266 INFO L225 Difference]: With dead ends: 72116 [2025-02-05 10:48:30,266 INFO L226 Difference]: Without dead ends: 44588 [2025-02-05 10:48:30,289 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 10:48:30,289 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:30,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 290 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44588 states. [2025-02-05 10:48:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44588 to 42958. [2025-02-05 10:48:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42958 states, 42957 states have (on average 1.0878552971576227) internal successors, (46731), 42957 states have internal predecessors, (46731), 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 10:48:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42958 states to 42958 states and 46731 transitions. [2025-02-05 10:48:30,860 INFO L78 Accepts]: Start accepts. Automaton has 42958 states and 46731 transitions. Word has length 320 [2025-02-05 10:48:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:30,860 INFO L471 AbstractCegarLoop]: Abstraction has 42958 states and 46731 transitions. [2025-02-05 10:48:30,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 10:48:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 42958 states and 46731 transitions. [2025-02-05 10:48:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-05 10:48:30,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:30,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:48:30,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 730884621, now seen corresponding path program 1 times [2025-02-05 10:48:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771239759] [2025-02-05 10:48:30,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:30,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 10:48:30,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 10:48:30,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:30,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771239759] [2025-02-05 10:48:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771239759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628066264] [2025-02-05 10:48:31,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:31,210 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 10:48:31,211 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 10:48:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 10:48:31,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 10:48:31,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:31,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:31,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:31,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628066264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:31,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:31,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:48:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143559251] [2025-02-05 10:48:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:48:31,422 INFO L87 Difference]: Start difference. First operand 42958 states and 46731 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 10:48:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:31,829 INFO L93 Difference]: Finished difference Result 119042 states and 129661 transitions. [2025-02-05 10:48:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 334 [2025-02-05 10:48:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:31,914 INFO L225 Difference]: With dead ends: 119042 [2025-02-05 10:48:31,914 INFO L226 Difference]: Without dead ends: 76086 [2025-02-05 10:48:31,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:48:31,952 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 214 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:31,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 761 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:48:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76086 states. [2025-02-05 10:48:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76086 to 74054. [2025-02-05 10:48:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74054 states, 74053 states have (on average 1.081090570267241) internal successors, (80058), 74053 states have internal predecessors, (80058), 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 10:48:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74054 states to 74054 states and 80058 transitions. [2025-02-05 10:48:32,743 INFO L78 Accepts]: Start accepts. Automaton has 74054 states and 80058 transitions. Word has length 334 [2025-02-05 10:48:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 74054 states and 80058 transitions. [2025-02-05 10:48:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 10:48:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74054 states and 80058 transitions. [2025-02-05 10:48:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 10:48:32,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:32,769 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:32,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:48:32,970 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,SelfDestructingSolverStorable12 [2025-02-05 10:48:32,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:32,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1275474607, now seen corresponding path program 1 times [2025-02-05 10:48:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474741449] [2025-02-05 10:48:32,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:33,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 10:48:33,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 10:48:33,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:33,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-05 10:48:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474741449] [2025-02-05 10:48:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474741449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:33,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644613662] [2025-02-05 10:48:33,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:33,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:33,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:33,321 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 10:48:33,322 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 10:48:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 10:48:33,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 10:48:33,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:33,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:33,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:48:33,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-05 10:48:33,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644613662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:33,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:48:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67020978] [2025-02-05 10:48:33,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:33,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:48:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:33,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:48:33,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:33,593 INFO L87 Difference]: Start difference. First operand 74054 states and 80058 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 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 10:48:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:34,784 INFO L93 Difference]: Finished difference Result 238340 states and 258442 transitions. [2025-02-05 10:48:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:48:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 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 336 [2025-02-05 10:48:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:34,983 INFO L225 Difference]: With dead ends: 238340 [2025-02-05 10:48:34,983 INFO L226 Difference]: Without dead ends: 164288 [2025-02-05 10:48:35,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:35,055 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 496 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:35,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 293 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164288 states. [2025-02-05 10:48:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164288 to 162041. [2025-02-05 10:48:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162041 states, 162040 states have (on average 1.0820414712416688) internal successors, (175334), 162040 states have internal predecessors, (175334), 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 10:48:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162041 states to 162041 states and 175334 transitions. [2025-02-05 10:48:37,350 INFO L78 Accepts]: Start accepts. Automaton has 162041 states and 175334 transitions. Word has length 336 [2025-02-05 10:48:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 162041 states and 175334 transitions. [2025-02-05 10:48:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 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 10:48:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 162041 states and 175334 transitions. [2025-02-05 10:48:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 10:48:37,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:37,390 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:37,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:48:37,591 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,SelfDestructingSolverStorable13 [2025-02-05 10:48:37,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1911958221, now seen corresponding path program 1 times [2025-02-05 10:48:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593025122] [2025-02-05 10:48:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:37,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 10:48:37,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 10:48:37,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:37,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-05 10:48:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593025122] [2025-02-05 10:48:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593025122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035574448] [2025-02-05 10:48:38,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:38,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:38,649 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 10:48:38,650 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 10:48:38,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 10:48:38,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 10:48:38,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:38,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:38,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:48:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:48:39,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035574448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-02-05 10:48:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641917996] [2025-02-05 10:48:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:48:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:39,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:48:39,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:48:39,143 INFO L87 Difference]: Start difference. First operand 162041 states and 175334 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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 10:48:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:41,823 INFO L93 Difference]: Finished difference Result 755800 states and 819008 transitions. [2025-02-05 10:48:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:48:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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 339 [2025-02-05 10:48:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:42,730 INFO L225 Difference]: With dead ends: 755800 [2025-02-05 10:48:42,731 INFO L226 Difference]: Without dead ends: 593761 [2025-02-05 10:48:42,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:48:42,988 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 962 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:42,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 924 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593761 states. [2025-02-05 10:48:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593761 to 583145. [2025-02-05 10:48:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583145 states, 583144 states have (on average 1.0801242917701288) internal successors, (629868), 583144 states have internal predecessors, (629868), 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 10:48:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583145 states to 583145 states and 629868 transitions. [2025-02-05 10:48:51,429 INFO L78 Accepts]: Start accepts. Automaton has 583145 states and 629868 transitions. Word has length 339 [2025-02-05 10:48:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 583145 states and 629868 transitions. [2025-02-05 10:48:51,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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 10:48:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 583145 states and 629868 transitions. [2025-02-05 10:48:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 10:48:51,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:51,491 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:48:51,498 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 10:48:51,691 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 10:48:51,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:51,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 177321954, now seen corresponding path program 1 times [2025-02-05 10:48:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25467449] [2025-02-05 10:48:51,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:51,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 10:48:51,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 10:48:51,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:51,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-02-05 10:48:52,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25467449] [2025-02-05 10:48:52,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25467449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882667452] [2025-02-05 10:48:52,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:52,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:52,648 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 10:48:52,648 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 10:48:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 10:48:52,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 10:48:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:52,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:52,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 10:48:52,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:52,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882667452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:52,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:52,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346543361] [2025-02-05 10:48:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:52,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:52,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:52,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:52,949 INFO L87 Difference]: Start difference. First operand 583145 states and 629868 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 10:48:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:57,746 INFO L93 Difference]: Finished difference Result 1413621 states and 1523989 transitions. [2025-02-05 10:48:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 340 [2025-02-05 10:48:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:59,547 INFO L225 Difference]: With dead ends: 1413621 [2025-02-05 10:48:59,547 INFO L226 Difference]: Without dead ends: 830478 [2025-02-05 10:48:59,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:59,754 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:59,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:49:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830478 states.