./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label12.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_label12.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 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:45:06,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:45:06,115 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:45:06,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:45:06,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:45:06,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:45:06,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:45:06,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:45:06,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:45:06,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:45:06,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:45:06,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:45:06,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:45:06,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:45:06,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:45:06,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:45:06,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:45:06,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:45:06,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:45:06,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:45:06,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:45:06,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:45:06,141 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 -> 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 [2025-02-05 10:45:06,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:45:06,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:45:06,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:45:06,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:45:06,436 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:45:06,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2025-02-05 10:45:07,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3322427c0/c8150b7b04fb49769743ef8516cc30fb/FLAGd894cbbcb [2025-02-05 10:45:08,266 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:45:08,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2025-02-05 10:45:08,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3322427c0/c8150b7b04fb49769743ef8516cc30fb/FLAGd894cbbcb [2025-02-05 10:45:08,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3322427c0/c8150b7b04fb49769743ef8516cc30fb [2025-02-05 10:45:08,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:45:08,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:45:08,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:45:08,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:45:08,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:45:08,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:08,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f498234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08, skipping insertion in model container [2025-02-05 10:45:08,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:08,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:45:08,698 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_label12.c[56222,56235] [2025-02-05 10:45:08,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:45:08,742 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:45:08,854 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_label12.c[56222,56235] [2025-02-05 10:45:08,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:45:08,881 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:45:08,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08 WrapperNode [2025-02-05 10:45:08,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:45:08,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:45:08,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:45:08,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:45:08,887 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:45:08" (1/1) ... [2025-02-05 10:45:08,913 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:45:08" (1/1) ... [2025-02-05 10:45:09,030 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:45:09,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:45:09,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:45:09,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:45:09,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:45:09,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,087 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:45:09,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:45:09,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:45:09,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:45:09,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:45:09,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (1/1) ... [2025-02-05 10:45:09,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:45:09,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:09,172 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:45:09,177 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:45:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:45:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:45:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:45:09,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:45:09,256 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:45:09,257 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:45:10,549 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:45:10,550 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:45:10,573 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:45:10,573 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:45:10,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:45:10 BoogieIcfgContainer [2025-02-05 10:45:10,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:45:10,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:45:10,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:45:10,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:45:10,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:45:08" (1/3) ... [2025-02-05 10:45:10,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adba8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:45:10, skipping insertion in model container [2025-02-05 10:45:10,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:45:08" (2/3) ... [2025-02-05 10:45:10,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adba8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:45:10, skipping insertion in model container [2025-02-05 10:45:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:45:10" (3/3) ... [2025-02-05 10:45:10,586 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label12.c [2025-02-05 10:45:10,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:45:10,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label12.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:45:10,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:45:10,655 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;@3edea039, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:45:10,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:45:10,659 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:45:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 10:45:10,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:10,669 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] [2025-02-05 10:45:10,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1451174516, now seen corresponding path program 1 times [2025-02-05 10:45:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491789118] [2025-02-05 10:45:10,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:10,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 10:45:10,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 10:45:10,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:10,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:11,420 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:45:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491789118] [2025-02-05 10:45:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491789118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:11,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228573706] [2025-02-05 10:45:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:11,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:11,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:11,442 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 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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:45:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:12,635 INFO L93 Difference]: Finished difference Result 810 states and 1442 transitions. [2025-02-05 10:45:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:12,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163 [2025-02-05 10:45:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:12,644 INFO L225 Difference]: With dead ends: 810 [2025-02-05 10:45:12,644 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 10:45:12,647 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:45:12,649 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 91 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:12,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 10:45:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 10:45:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-02-05 10:45:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 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:45:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2025-02-05 10:45:12,732 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 163 [2025-02-05 10:45:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:12,733 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2025-02-05 10:45:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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:45:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2025-02-05 10:45:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 10:45:12,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:12,736 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] [2025-02-05 10:45:12,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:45:12,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:12,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -399781258, now seen corresponding path program 1 times [2025-02-05 10:45:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111014680] [2025-02-05 10:45:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:12,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 10:45:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 10:45:12,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:12,886 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:45:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111014680] [2025-02-05 10:45:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111014680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:12,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:12,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488646486] [2025-02-05 10:45:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:12,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:12,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:12,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:12,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:12,892 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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:45:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:13,537 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2025-02-05 10:45:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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 171 [2025-02-05 10:45:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:13,541 INFO L225 Difference]: With dead ends: 1312 [2025-02-05 10:45:13,541 INFO L226 Difference]: Without dead ends: 870 [2025-02-05 10:45:13,542 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:45:13,542 INFO L435 NwaCegarLoop]: 77 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, 91 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:45:13,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-02-05 10:45:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2025-02-05 10:45:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3953216374269006) internal successors, (1193), 855 states have internal predecessors, (1193), 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:45:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1193 transitions. [2025-02-05 10:45:13,573 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1193 transitions. Word has length 171 [2025-02-05 10:45:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:13,574 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1193 transitions. [2025-02-05 10:45:13,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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:45:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1193 transitions. [2025-02-05 10:45:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 10:45:13,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:13,579 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] [2025-02-05 10:45:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:45:13,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash -447224943, now seen corresponding path program 1 times [2025-02-05 10:45:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556307662] [2025-02-05 10:45:13,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 10:45:13,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 10:45:13,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:13,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:13,819 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:45:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556307662] [2025-02-05 10:45:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556307662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631197408] [2025-02-05 10:45:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:13,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:13,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:13,821 INFO L87 Difference]: Start difference. First operand 856 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:45:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:14,551 INFO L93 Difference]: Finished difference Result 2541 states and 3551 transitions. [2025-02-05 10:45:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:14,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 178 [2025-02-05 10:45:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:14,557 INFO L225 Difference]: With dead ends: 2541 [2025-02-05 10:45:14,557 INFO L226 Difference]: Without dead ends: 1687 [2025-02-05 10:45:14,558 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:45:14,559 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 81 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:14,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 365 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:45:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-02-05 10:45:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1673. [2025-02-05 10:45:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1672 states have (on average 1.3600478468899522) internal successors, (2274), 1672 states have internal predecessors, (2274), 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:45:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2274 transitions. [2025-02-05 10:45:14,585 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2274 transitions. Word has length 178 [2025-02-05 10:45:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2274 transitions. [2025-02-05 10:45:14,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:45:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2274 transitions. [2025-02-05 10:45:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 10:45:14,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:14,588 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2025-02-05 10:45:14,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:45:14,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -182913130, now seen corresponding path program 1 times [2025-02-05 10:45:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660673768] [2025-02-05 10:45:14,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:14,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 10:45:14,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 10:45:14,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:14,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:45:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660673768] [2025-02-05 10:45:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660673768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:14,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047850230] [2025-02-05 10:45:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:14,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:14,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:14,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:14,716 INFO L87 Difference]: Start difference. First operand 1673 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:45:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:15,503 INFO L93 Difference]: Finished difference Result 4976 states and 6770 transitions. [2025-02-05 10:45:15,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 184 [2025-02-05 10:45:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:15,512 INFO L225 Difference]: With dead ends: 4976 [2025-02-05 10:45:15,512 INFO L226 Difference]: Without dead ends: 3305 [2025-02-05 10:45:15,514 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:45:15,515 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 257 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 358 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:45:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-02-05 10:45:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3300. [2025-02-05 10:45:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3299 states have (on average 1.3094877235525917) internal successors, (4320), 3299 states have internal predecessors, (4320), 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:45:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4320 transitions. [2025-02-05 10:45:15,559 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4320 transitions. Word has length 184 [2025-02-05 10:45:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4320 transitions. [2025-02-05 10:45:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:45:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4320 transitions. [2025-02-05 10:45:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 10:45:15,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:15,563 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 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:45:15,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:45:15,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:15,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -914633027, now seen corresponding path program 1 times [2025-02-05 10:45:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035830813] [2025-02-05 10:45:15,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:15,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 10:45:15,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 10:45:15,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:45:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035830813] [2025-02-05 10:45:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035830813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:15,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040989069] [2025-02-05 10:45:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:15,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:15,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:15,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:15,751 INFO L87 Difference]: Start difference. First operand 3300 states and 4320 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:45:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:16,393 INFO L93 Difference]: Finished difference Result 8022 states and 10763 transitions. [2025-02-05 10:45:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 190 [2025-02-05 10:45:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:16,408 INFO L225 Difference]: With dead ends: 8022 [2025-02-05 10:45:16,408 INFO L226 Difference]: Without dead ends: 4724 [2025-02-05 10:45:16,410 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:45:16,412 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:16,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 407 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2025-02-05 10:45:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4722. [2025-02-05 10:45:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 4721 states have (on average 1.2668926074984113) internal successors, (5981), 4721 states have internal predecessors, (5981), 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:45:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 5981 transitions. [2025-02-05 10:45:16,490 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 5981 transitions. Word has length 190 [2025-02-05 10:45:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:16,491 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 5981 transitions. [2025-02-05 10:45:16,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:45:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 5981 transitions. [2025-02-05 10:45:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 10:45:16,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:16,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-02-05 10:45:16,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:45:16,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2118726800, now seen corresponding path program 1 times [2025-02-05 10:45:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57548844] [2025-02-05 10:45:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:16,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 10:45:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 10:45:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:45:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57548844] [2025-02-05 10:45:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57548844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333737821] [2025-02-05 10:45:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:16,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:16,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:16,626 INFO L87 Difference]: Start difference. First operand 4722 states and 5981 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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:45:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:16,996 INFO L93 Difference]: Finished difference Result 9216 states and 11710 transitions. [2025-02-05 10:45:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 198 [2025-02-05 10:45:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:17,010 INFO L225 Difference]: With dead ends: 9216 [2025-02-05 10:45:17,011 INFO L226 Difference]: Without dead ends: 4496 [2025-02-05 10:45:17,016 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:45:17,018 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:17,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:45:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-02-05 10:45:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4496. [2025-02-05 10:45:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.228921023359288) internal successors, (5524), 4495 states have internal predecessors, (5524), 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:45:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5524 transitions. [2025-02-05 10:45:17,097 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5524 transitions. Word has length 198 [2025-02-05 10:45:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:17,098 INFO L471 AbstractCegarLoop]: Abstraction has 4496 states and 5524 transitions. [2025-02-05 10:45:17,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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:45:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5524 transitions. [2025-02-05 10:45:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 10:45:17,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:17,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:45:17,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash -118501165, now seen corresponding path program 1 times [2025-02-05 10:45:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510392213] [2025-02-05 10:45:17,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:17,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 10:45:17,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:45:17,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:17,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:45:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510392213] [2025-02-05 10:45:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510392213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93785932] [2025-02-05 10:45:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:17,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:17,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:17,277 INFO L87 Difference]: Start difference. First operand 4496 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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:45:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:17,911 INFO L93 Difference]: Finished difference Result 12856 states and 15730 transitions. [2025-02-05 10:45:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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 217 [2025-02-05 10:45:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:17,932 INFO L225 Difference]: With dead ends: 12856 [2025-02-05 10:45:17,932 INFO L226 Difference]: Without dead ends: 8362 [2025-02-05 10:45:17,939 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:45:17,939 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 189 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:17,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 155 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8362 states. [2025-02-05 10:45:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8362 to 8358. [2025-02-05 10:45:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 1.1925332056958238) internal successors, (9966), 8357 states have internal predecessors, (9966), 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:45:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 9966 transitions. [2025-02-05 10:45:18,040 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 9966 transitions. Word has length 217 [2025-02-05 10:45:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:18,041 INFO L471 AbstractCegarLoop]: Abstraction has 8358 states and 9966 transitions. [2025-02-05 10:45:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 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:45:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 9966 transitions. [2025-02-05 10:45:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 10:45:18,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:18,048 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, 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] [2025-02-05 10:45:18,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:45:18,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:18,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1806952743, now seen corresponding path program 1 times [2025-02-05 10:45:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062417153] [2025-02-05 10:45:18,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 10:45:18,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 10:45:18,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062417153] [2025-02-05 10:45:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062417153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664092002] [2025-02-05 10:45:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:18,268 INFO L87 Difference]: Start difference. First operand 8358 states and 9966 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:45:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:18,991 INFO L93 Difference]: Finished difference Result 20793 states and 24799 transitions. [2025-02-05 10:45:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-02-05 10:45:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:19,023 INFO L225 Difference]: With dead ends: 20793 [2025-02-05 10:45:19,023 INFO L226 Difference]: Without dead ends: 12437 [2025-02-05 10:45:19,031 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:45:19,032 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 207 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:19,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 69 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:45:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12437 states. [2025-02-05 10:45:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12437 to 12434. [2025-02-05 10:45:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12434 states, 12433 states have (on average 1.190300008043111) internal successors, (14799), 12433 states have internal predecessors, (14799), 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:45:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12434 states to 12434 states and 14799 transitions. [2025-02-05 10:45:19,190 INFO L78 Accepts]: Start accepts. Automaton has 12434 states and 14799 transitions. Word has length 225 [2025-02-05 10:45:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:19,191 INFO L471 AbstractCegarLoop]: Abstraction has 12434 states and 14799 transitions. [2025-02-05 10:45:19,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:45:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 12434 states and 14799 transitions. [2025-02-05 10:45:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 10:45:19,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:19,202 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:45:19,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:19,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1845913012, now seen corresponding path program 1 times [2025-02-05 10:45:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066617891] [2025-02-05 10:45:19,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 10:45:19,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 10:45:19,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:19,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066617891] [2025-02-05 10:45:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066617891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582476877] [2025-02-05 10:45:19,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:19,636 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:45:19,638 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:45:19,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 10:45:19,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 10:45:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:19,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:45:19,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 10:45:20,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582476877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 10:45:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025856958] [2025-02-05 10:45:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:20,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:20,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:45:20,021 INFO L87 Difference]: Start difference. First operand 12434 states and 14799 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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:45:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:21,103 INFO L93 Difference]: Finished difference Result 35035 states and 41789 transitions. [2025-02-05 10:45:21,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 232 [2025-02-05 10:45:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:21,144 INFO L225 Difference]: With dead ends: 35035 [2025-02-05 10:45:21,145 INFO L226 Difference]: Without dead ends: 22603 [2025-02-05 10:45:21,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 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:45:21,160 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 85 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:21,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 152 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 10:45:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22603 states. [2025-02-05 10:45:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22603 to 22601. [2025-02-05 10:45:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22601 states, 22600 states have (on average 1.1710619469026549) internal successors, (26466), 22600 states have internal predecessors, (26466), 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:45:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22601 states to 22601 states and 26466 transitions. [2025-02-05 10:45:21,483 INFO L78 Accepts]: Start accepts. Automaton has 22601 states and 26466 transitions. Word has length 232 [2025-02-05 10:45:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:21,483 INFO L471 AbstractCegarLoop]: Abstraction has 22601 states and 26466 transitions. [2025-02-05 10:45:21,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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:45:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22601 states and 26466 transitions. [2025-02-05 10:45:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 10:45:21,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:21,505 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 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] [2025-02-05 10:45:21,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:45:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:21,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash -120190696, now seen corresponding path program 1 times [2025-02-05 10:45:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003414895] [2025-02-05 10:45:21,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 10:45:21,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 10:45:21,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:21,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:45:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003414895] [2025-02-05 10:45:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003414895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:22,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826994173] [2025-02-05 10:45:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:45:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:45:22,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:45:22,015 INFO L87 Difference]: Start difference. First operand 22601 states and 26466 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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:45:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:23,445 INFO L93 Difference]: Finished difference Result 68580 states and 80250 transitions. [2025-02-05 10:45:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:45:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 232 [2025-02-05 10:45:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:23,543 INFO L225 Difference]: With dead ends: 68580 [2025-02-05 10:45:23,544 INFO L226 Difference]: Without dead ends: 45979 [2025-02-05 10:45:23,573 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:45:23,574 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 449 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:23,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 432 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 10:45:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45979 states. [2025-02-05 10:45:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45979 to 45974. [2025-02-05 10:45:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45974 states, 45973 states have (on average 1.1533726317621213) internal successors, (53024), 45973 states have internal predecessors, (53024), 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:45:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45974 states to 45974 states and 53024 transitions. [2025-02-05 10:45:24,209 INFO L78 Accepts]: Start accepts. Automaton has 45974 states and 53024 transitions. Word has length 232 [2025-02-05 10:45:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 45974 states and 53024 transitions. [2025-02-05 10:45:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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:45:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45974 states and 53024 transitions. [2025-02-05 10:45:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 10:45:24,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:24,241 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, 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] [2025-02-05 10:45:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:45:24,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -268592049, now seen corresponding path program 1 times [2025-02-05 10:45:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134701760] [2025-02-05 10:45:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:24,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 10:45:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 10:45:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:24,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134701760] [2025-02-05 10:45:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134701760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648157860] [2025-02-05 10:45:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:24,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:24,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:24,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:24,627 INFO L87 Difference]: Start difference. First operand 45974 states and 53024 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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:45:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:25,657 INFO L93 Difference]: Finished difference Result 116777 states and 134544 transitions. [2025-02-05 10:45:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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 272 [2025-02-05 10:45:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:25,749 INFO L225 Difference]: With dead ends: 116777 [2025-02-05 10:45:25,750 INFO L226 Difference]: Without dead ends: 70805 [2025-02-05 10:45:25,784 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:45:25,785 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:25,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 152 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:45:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70805 states. [2025-02-05 10:45:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70805 to 70800. [2025-02-05 10:45:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70800 states, 70799 states have (on average 1.1502846085396687) internal successors, (81439), 70799 states have internal predecessors, (81439), 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:45:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70800 states to 70800 states and 81439 transitions. [2025-02-05 10:45:26,662 INFO L78 Accepts]: Start accepts. Automaton has 70800 states and 81439 transitions. Word has length 272 [2025-02-05 10:45:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:26,662 INFO L471 AbstractCegarLoop]: Abstraction has 70800 states and 81439 transitions. [2025-02-05 10:45:26,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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:45:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 70800 states and 81439 transitions. [2025-02-05 10:45:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 10:45:26,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:26,692 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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] [2025-02-05 10:45:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:45:26,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1062336492, now seen corresponding path program 1 times [2025-02-05 10:45:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783764177] [2025-02-05 10:45:26,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:26,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 10:45:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 10:45:26,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 121 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783764177] [2025-02-05 10:45:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783764177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281314163] [2025-02-05 10:45:28,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:28,041 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:45:28,042 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:45:28,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 10:45:28,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 10:45:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:28,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:45:28,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:45:28,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281314163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:45:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168190594] [2025-02-05 10:45:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:28,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:28,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:28,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:45:28,337 INFO L87 Difference]: Start difference. First operand 70800 states and 81439 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 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:45:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:29,470 INFO L93 Difference]: Finished difference Result 141243 states and 162381 transitions. [2025-02-05 10:45:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 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 279 [2025-02-05 10:45:29,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:29,575 INFO L225 Difference]: With dead ends: 141243 [2025-02-05 10:45:29,575 INFO L226 Difference]: Without dead ends: 70445 [2025-02-05 10:45:29,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:45:29,634 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 154 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:29,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 158 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:45:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70445 states. [2025-02-05 10:45:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70445 to 70394. [2025-02-05 10:45:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70394 states, 70393 states have (on average 1.1452133024590514) internal successors, (80615), 70393 states have internal predecessors, (80615), 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:45:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70394 states to 70394 states and 80615 transitions. [2025-02-05 10:45:30,719 INFO L78 Accepts]: Start accepts. Automaton has 70394 states and 80615 transitions. Word has length 279 [2025-02-05 10:45:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:30,720 INFO L471 AbstractCegarLoop]: Abstraction has 70394 states and 80615 transitions. [2025-02-05 10:45:30,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 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:45:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 70394 states and 80615 transitions. [2025-02-05 10:45:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-02-05 10:45:30,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:30,763 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 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] [2025-02-05 10:45:30,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:45:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:30,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:30,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1123706444, now seen corresponding path program 1 times [2025-02-05 10:45:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990557530] [2025-02-05 10:45:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-05 10:45:31,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-05 10:45:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:45:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990557530] [2025-02-05 10:45:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990557530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:31,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539436145] [2025-02-05 10:45:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:45:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:45:31,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:45:31,360 INFO L87 Difference]: Start difference. First operand 70394 states and 80615 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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:45:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:32,328 INFO L93 Difference]: Finished difference Result 140790 states and 161236 transitions. [2025-02-05 10:45:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:45:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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 285 [2025-02-05 10:45:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:32,411 INFO L225 Difference]: With dead ends: 140790 [2025-02-05 10:45:32,411 INFO L226 Difference]: Without dead ends: 70398 [2025-02-05 10:45:32,472 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:45:32,476 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 444 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:32,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 62 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70398 states. [2025-02-05 10:45:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70398 to 69988. [2025-02-05 10:45:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69988 states, 69987 states have (on average 1.1361967222484175) internal successors, (79519), 69987 states have internal predecessors, (79519), 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:45:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69988 states to 69988 states and 79519 transitions. [2025-02-05 10:45:33,386 INFO L78 Accepts]: Start accepts. Automaton has 69988 states and 79519 transitions. Word has length 285 [2025-02-05 10:45:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:33,386 INFO L471 AbstractCegarLoop]: Abstraction has 69988 states and 79519 transitions. [2025-02-05 10:45:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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:45:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69988 states and 79519 transitions. [2025-02-05 10:45:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-05 10:45:33,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:33,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2025-02-05 10:45:33,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:45:33,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 206154712, now seen corresponding path program 1 times [2025-02-05 10:45:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202115048] [2025-02-05 10:45:33,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-05 10:45:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-05 10:45:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202115048] [2025-02-05 10:45:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202115048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:33,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077024988] [2025-02-05 10:45:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:33,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:45:33,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:33,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:45:33,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:45:33,911 INFO L87 Difference]: Start difference. First operand 69988 states and 79519 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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:45:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:35,456 INFO L93 Difference]: Finished difference Result 141239 states and 160584 transitions. [2025-02-05 10:45:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:45:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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 299 [2025-02-05 10:45:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:35,552 INFO L225 Difference]: With dead ends: 141239 [2025-02-05 10:45:35,552 INFO L226 Difference]: Without dead ends: 71253 [2025-02-05 10:45:35,604 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:45:35,604 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 357 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:35,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 88 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 10:45:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71253 states. [2025-02-05 10:45:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71253 to 70394. [2025-02-05 10:45:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70394 states, 70393 states have (on average 1.116460443510008) internal successors, (78591), 70393 states have internal predecessors, (78591), 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:45:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70394 states to 70394 states and 78591 transitions. [2025-02-05 10:45:36,314 INFO L78 Accepts]: Start accepts. Automaton has 70394 states and 78591 transitions. Word has length 299 [2025-02-05 10:45:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:36,314 INFO L471 AbstractCegarLoop]: Abstraction has 70394 states and 78591 transitions. [2025-02-05 10:45:36,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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:45:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 70394 states and 78591 transitions. [2025-02-05 10:45:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 10:45:36,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:36,347 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, 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] [2025-02-05 10:45:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:45:36,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1830321866, now seen corresponding path program 1 times [2025-02-05 10:45:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616118343] [2025-02-05 10:45:36,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 10:45:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 10:45:36,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-05 10:45:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616118343] [2025-02-05 10:45:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616118343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831416370] [2025-02-05 10:45:36,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:36,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:36,616 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:45:36,617 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:45:36,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 10:45:36,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 10:45:36,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:36,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:36,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:45:36,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 10:45:36,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831416370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:36,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:45:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919724330] [2025-02-05 10:45:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:45:36,963 INFO L87 Difference]: Start difference. First operand 70394 states and 78591 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:45:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:37,723 INFO L93 Difference]: Finished difference Result 140188 states and 156515 transitions. [2025-02-05 10:45:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:37,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 305 [2025-02-05 10:45:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:37,808 INFO L225 Difference]: With dead ends: 140188 [2025-02-05 10:45:37,808 INFO L226 Difference]: Without dead ends: 69796 [2025-02-05 10:45:37,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 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:45:37,856 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 100 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:37,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 289 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:45:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69796 states. [2025-02-05 10:45:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69796 to 69783. [2025-02-05 10:45:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69783 states, 69782 states have (on average 1.1106159181450803) internal successors, (77501), 69782 states have internal predecessors, (77501), 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:45:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69783 states to 69783 states and 77501 transitions. [2025-02-05 10:45:39,004 INFO L78 Accepts]: Start accepts. Automaton has 69783 states and 77501 transitions. Word has length 305 [2025-02-05 10:45:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 69783 states and 77501 transitions. [2025-02-05 10:45:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:45:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69783 states and 77501 transitions. [2025-02-05 10:45:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 10:45:39,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:39,033 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:39,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:45:39,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:39,234 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1598952843, now seen corresponding path program 2 times [2025-02-05 10:45:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189310483] [2025-02-05 10:45:39,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:45:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:39,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 333 statements into 2 equivalence classes. [2025-02-05 10:45:39,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 10:45:39,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:45:39,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 10:45:39,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:39,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189310483] [2025-02-05 10:45:39,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189310483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:39,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240595926] [2025-02-05 10:45:39,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:45:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:39,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:39,624 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:45:39,626 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:45:39,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 333 statements into 2 equivalence classes. [2025-02-05 10:45:39,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 10:45:39,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:45:39,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:39,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:45:39,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 10:45:39,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240595926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:45:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173568995] [2025-02-05 10:45:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:39,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:39,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:45:39,843 INFO L87 Difference]: Start difference. First operand 69783 states and 77501 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:45:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:40,740 INFO L93 Difference]: Finished difference Result 135298 states and 150112 transitions. [2025-02-05 10:45:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:40,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 333 [2025-02-05 10:45:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:40,969 INFO L225 Difference]: With dead ends: 135298 [2025-02-05 10:45:40,969 INFO L226 Difference]: Without dead ends: 65517 [2025-02-05 10:45:40,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 332 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:45:40,995 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 220 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:40,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 308 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:45:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65517 states. [2025-02-05 10:45:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65517 to 53323. [2025-02-05 10:45:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53323 states, 53322 states have (on average 1.0977645249615544) internal successors, (58535), 53322 states have internal predecessors, (58535), 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:45:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53323 states to 53323 states and 58535 transitions. [2025-02-05 10:45:41,745 INFO L78 Accepts]: Start accepts. Automaton has 53323 states and 58535 transitions. Word has length 333 [2025-02-05 10:45:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:41,745 INFO L471 AbstractCegarLoop]: Abstraction has 53323 states and 58535 transitions. [2025-02-05 10:45:41,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:45:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 53323 states and 58535 transitions. [2025-02-05 10:45:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 10:45:41,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:41,770 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, 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, 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] [2025-02-05 10:45:41,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:45:41,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,SelfDestructingSolverStorable15 [2025-02-05 10:45:41,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 269640102, now seen corresponding path program 1 times [2025-02-05 10:45:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917377442] [2025-02-05 10:45:41,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:42,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 10:45:42,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 10:45:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:45:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917377442] [2025-02-05 10:45:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917377442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:42,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268261702] [2025-02-05 10:45:42,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:42,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:42,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:42,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:42,274 INFO L87 Difference]: Start difference. First operand 53323 states and 58535 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:45:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:43,176 INFO L93 Difference]: Finished difference Result 109312 states and 120126 transitions. [2025-02-05 10:45:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:43,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:45:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:43,261 INFO L225 Difference]: With dead ends: 109312 [2025-02-05 10:45:43,261 INFO L226 Difference]: Without dead ends: 55991 [2025-02-05 10:45:43,302 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:45:43,303 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 187 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:43,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 328 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55991 states. [2025-02-05 10:45:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55991 to 49669. [2025-02-05 10:45:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49669 states, 49668 states have (on average 1.099379882419264) internal successors, (54604), 49668 states have internal predecessors, (54604), 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:45:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49669 states to 49669 states and 54604 transitions. [2025-02-05 10:45:43,938 INFO L78 Accepts]: Start accepts. Automaton has 49669 states and 54604 transitions. Word has length 336 [2025-02-05 10:45:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:43,939 INFO L471 AbstractCegarLoop]: Abstraction has 49669 states and 54604 transitions. [2025-02-05 10:45:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:45:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49669 states and 54604 transitions. [2025-02-05 10:45:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-05 10:45:43,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:43,959 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, 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] [2025-02-05 10:45:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:45:43,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1205503984, now seen corresponding path program 1 times [2025-02-05 10:45:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647784489] [2025-02-05 10:45:43,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:44,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-05 10:45:44,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-05 10:45:44,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:44,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-02-05 10:45:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647784489] [2025-02-05 10:45:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647784489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437567011] [2025-02-05 10:45:45,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:45,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:45,213 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:45:45,215 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:45:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-05 10:45:45,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-05 10:45:45,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:45,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:45,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:45:45,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 216 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:45:45,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:45:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 216 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:45:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437567011] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:45:45,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:45:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2025-02-05 10:45:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146617315] [2025-02-05 10:45:45,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:45:45,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:45:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:45,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:45:45,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:45:45,623 INFO L87 Difference]: Start difference. First operand 49669 states and 54604 transitions. Second operand has 7 states, 7 states have (on average 49.285714285714285) internal successors, (345), 6 states have internal predecessors, (345), 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:45:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:47,423 INFO L93 Difference]: Finished difference Result 102399 states and 112318 transitions. [2025-02-05 10:45:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:45:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.285714285714285) internal successors, (345), 6 states have internal predecessors, (345), 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 343 [2025-02-05 10:45:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:47,486 INFO L225 Difference]: With dead ends: 102399 [2025-02-05 10:45:47,487 INFO L226 Difference]: Without dead ends: 52732 [2025-02-05 10:45:47,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:45:47,515 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1787 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:47,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 129 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 10:45:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52732 states. [2025-02-05 10:45:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52732 to 47639. [2025-02-05 10:45:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47639 states, 47638 states have (on average 1.095176119904278) internal successors, (52172), 47638 states have internal predecessors, (52172), 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:45:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47639 states to 47639 states and 52172 transitions. [2025-02-05 10:45:48,141 INFO L78 Accepts]: Start accepts. Automaton has 47639 states and 52172 transitions. Word has length 343 [2025-02-05 10:45:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:48,141 INFO L471 AbstractCegarLoop]: Abstraction has 47639 states and 52172 transitions. [2025-02-05 10:45:48,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.285714285714285) internal successors, (345), 6 states have internal predecessors, (345), 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:45:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 47639 states and 52172 transitions. [2025-02-05 10:45:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 10:45:48,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:48,163 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, 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] [2025-02-05 10:45:48,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:45:48,364 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,SelfDestructingSolverStorable17 [2025-02-05 10:45:48,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:48,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1862299817, now seen corresponding path program 1 times [2025-02-05 10:45:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874468440] [2025-02-05 10:45:48,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 10:45:48,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 10:45:48,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:48,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 10:45:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874468440] [2025-02-05 10:45:48,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874468440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125331294] [2025-02-05 10:45:48,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:48,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:48,818 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:45:48,820 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:45:48,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 10:45:49,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 10:45:49,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:49,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:49,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:45:49,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 10:45:49,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125331294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:49,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:45:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377596748] [2025-02-05 10:45:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:45:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:49,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:45:49,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:45:49,205 INFO L87 Difference]: Start difference. First operand 47639 states and 52172 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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:45:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:50,148 INFO L93 Difference]: Finished difference Result 130452 states and 143024 transitions. [2025-02-05 10:45:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:45:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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 358 [2025-02-05 10:45:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:50,234 INFO L225 Difference]: With dead ends: 130452 [2025-02-05 10:45:50,234 INFO L226 Difference]: Without dead ends: 83830 [2025-02-05 10:45:50,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 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:45:50,283 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 774 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:50,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 307 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:45:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83830 states. [2025-02-05 10:45:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83830 to 76714. [2025-02-05 10:45:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76714 states, 76713 states have (on average 1.0978452152829377) internal successors, (84219), 76713 states have internal predecessors, (84219), 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:45:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76714 states to 76714 states and 84219 transitions. [2025-02-05 10:45:51,288 INFO L78 Accepts]: Start accepts. Automaton has 76714 states and 84219 transitions. Word has length 358 [2025-02-05 10:45:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 76714 states and 84219 transitions. [2025-02-05 10:45:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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:45:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76714 states and 84219 transitions. [2025-02-05 10:45:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 10:45:51,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:51,324 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, 4, 4, 4, 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, 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] [2025-02-05 10:45:51,333 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:45:51,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:51,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:51,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -678926802, now seen corresponding path program 1 times [2025-02-05 10:45:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609805895] [2025-02-05 10:45:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:51,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 10:45:51,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 10:45:51,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:51,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-05 10:45:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609805895] [2025-02-05 10:45:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609805895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:51,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:45:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120762646] [2025-02-05 10:45:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:45:51,976 INFO L87 Difference]: Start difference. First operand 76714 states and 84219 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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:45:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:52,850 INFO L93 Difference]: Finished difference Result 218753 states and 240432 transitions. [2025-02-05 10:45:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:45:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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 409 [2025-02-05 10:45:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:53,019 INFO L225 Difference]: With dead ends: 218753 [2025-02-05 10:45:53,019 INFO L226 Difference]: Without dead ends: 143056 [2025-02-05 10:45:53,052 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:45:53,054 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 208 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:53,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 519 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:45:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143056 states. [2025-02-05 10:45:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143056 to 140003. [2025-02-05 10:45:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140003 states, 140002 states have (on average 1.099191440122284) internal successors, (153889), 140002 states have internal predecessors, (153889), 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:45:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140003 states to 140003 states and 153889 transitions. [2025-02-05 10:45:54,680 INFO L78 Accepts]: Start accepts. Automaton has 140003 states and 153889 transitions. Word has length 409 [2025-02-05 10:45:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:54,680 INFO L471 AbstractCegarLoop]: Abstraction has 140003 states and 153889 transitions. [2025-02-05 10:45:54,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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:45:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 140003 states and 153889 transitions. [2025-02-05 10:45:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 10:45:54,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:54,713 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 10:45:54,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:45:54,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1641149669, now seen corresponding path program 1 times [2025-02-05 10:45:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275571789] [2025-02-05 10:45:54,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 10:45:54,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 10:45:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:45:55,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275571789] [2025-02-05 10:45:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275571789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:45:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:45:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497677880] [2025-02-05 10:45:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:55,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:45:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:55,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:45:55,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:45:55,376 INFO L87 Difference]: Start difference. First operand 140003 states and 153889 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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:45:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:45:56,720 INFO L93 Difference]: Finished difference Result 265800 states and 291570 transitions. [2025-02-05 10:45:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:45:56,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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 409 [2025-02-05 10:45:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:45:56,941 INFO L225 Difference]: With dead ends: 265800 [2025-02-05 10:45:56,942 INFO L226 Difference]: Without dead ends: 126814 [2025-02-05 10:45:57,039 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:45:57,040 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 280 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:45:57,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 53 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:45:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126814 states. [2025-02-05 10:45:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126814 to 111721. [2025-02-05 10:45:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111721 states, 111720 states have (on average 1.0931167203723595) internal successors, (122123), 111720 states have internal predecessors, (122123), 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:45:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111721 states to 111721 states and 122123 transitions. [2025-02-05 10:45:58,517 INFO L78 Accepts]: Start accepts. Automaton has 111721 states and 122123 transitions. Word has length 409 [2025-02-05 10:45:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:45:58,517 INFO L471 AbstractCegarLoop]: Abstraction has 111721 states and 122123 transitions. [2025-02-05 10:45:58,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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:45:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 111721 states and 122123 transitions. [2025-02-05 10:45:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-05 10:45:58,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:45:58,768 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 4, 4, 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, 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] [2025-02-05 10:45:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:45:58,768 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:45:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:45:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1541603931, now seen corresponding path program 1 times [2025-02-05 10:45:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:45:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291623894] [2025-02-05 10:45:58,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:45:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-05 10:45:58,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-05 10:45:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 290 proven. 9 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 10:45:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:45:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291623894] [2025-02-05 10:45:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291623894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:45:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491028132] [2025-02-05 10:45:59,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:45:59,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:45:59,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:45:59,595 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:45:59,597 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:45:59,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-05 10:45:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-05 10:45:59,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:45:59,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:45:59,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:45:59,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:45:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 10:45:59,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:45:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491028132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:45:59,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:45:59,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:45:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511477979] [2025-02-05 10:45:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:45:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:45:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:45:59,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:45:59,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:45:59,939 INFO L87 Difference]: Start difference. First operand 111721 states and 122123 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:46:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:00,670 INFO L93 Difference]: Finished difference Result 225065 states and 245692 transitions. [2025-02-05 10:46:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 432 [2025-02-05 10:46:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:00,806 INFO L225 Difference]: With dead ends: 225065 [2025-02-05 10:46:00,807 INFO L226 Difference]: Without dead ends: 114158 [2025-02-05 10:46:00,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:00,875 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 241 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:00,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 773 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:46:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114158 states. [2025-02-05 10:46:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114158 to 109674. [2025-02-05 10:46:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109674 states, 109673 states have (on average 1.0827733352785098) internal successors, (118751), 109673 states have internal predecessors, (118751), 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:46:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109674 states to 109674 states and 118751 transitions. [2025-02-05 10:46:02,539 INFO L78 Accepts]: Start accepts. Automaton has 109674 states and 118751 transitions. Word has length 432 [2025-02-05 10:46:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:02,539 INFO L471 AbstractCegarLoop]: Abstraction has 109674 states and 118751 transitions. [2025-02-05 10:46:02,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:46:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 109674 states and 118751 transitions. [2025-02-05 10:46:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-02-05 10:46:02,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:02,562 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:46:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:02,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash -298651810, now seen corresponding path program 1 times [2025-02-05 10:46:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329451139] [2025-02-05 10:46:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:02,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-05 10:46:02,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-05 10:46:02,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:02,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 310 proven. 9 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-05 10:46:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329451139] [2025-02-05 10:46:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329451139] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198856139] [2025-02-05 10:46:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:03,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:03,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:46:03,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:46:03,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-05 10:46:03,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-05 10:46:03,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:03,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:03,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:03,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 10:46:03,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198856139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:03,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:46:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572557275] [2025-02-05 10:46:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:03,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:03,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:03,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:03,590 INFO L87 Difference]: Start difference. First operand 109674 states and 118751 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:46:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:04,481 INFO L93 Difference]: Finished difference Result 215281 states and 232648 transitions. [2025-02-05 10:46:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 452 [2025-02-05 10:46:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:04,585 INFO L225 Difference]: With dead ends: 215281 [2025-02-05 10:46:04,585 INFO L226 Difference]: Without dead ends: 80636 [2025-02-05 10:46:04,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:04,656 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 204 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:04,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 100 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80636 states. [2025-02-05 10:46:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80636 to 55379. [2025-02-05 10:46:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55379 states, 55378 states have (on average 1.039997833074506) internal successors, (57593), 55378 states have internal predecessors, (57593), 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:46:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55379 states to 55379 states and 57593 transitions. [2025-02-05 10:46:05,640 INFO L78 Accepts]: Start accepts. Automaton has 55379 states and 57593 transitions. Word has length 452 [2025-02-05 10:46:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 55379 states and 57593 transitions. [2025-02-05 10:46:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:46:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55379 states and 57593 transitions. [2025-02-05 10:46:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-05 10:46:05,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:05,656 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:05,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:46:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:05,857 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1026108022, now seen corresponding path program 1 times [2025-02-05 10:46:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954529342] [2025-02-05 10:46:05,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:05,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-05 10:46:05,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-05 10:46:05,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 394 proven. 61 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-05 10:46:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954529342] [2025-02-05 10:46:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954529342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597783131] [2025-02-05 10:46:07,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:07,052 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:07,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:46:07,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-05 10:46:07,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-05 10:46:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:07,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:07,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:46:07,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-05 10:46:07,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597783131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 10:46:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153099698] [2025-02-05 10:46:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:07,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:07,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:46:07,565 INFO L87 Difference]: Start difference. First operand 55379 states and 57593 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:46:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:08,338 INFO L93 Difference]: Finished difference Result 114809 states and 119549 transitions. [2025-02-05 10:46:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 455 [2025-02-05 10:46:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:08,431 INFO L225 Difference]: With dead ends: 114809 [2025-02-05 10:46:08,432 INFO L226 Difference]: Without dead ends: 59432 [2025-02-05 10:46:08,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:46:08,475 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 150 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:08,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 313 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:46:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59432 states. [2025-02-05 10:46:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59432 to 54560. [2025-02-05 10:46:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54560 states, 54559 states have (on average 1.0399750728569073) internal successors, (56740), 54559 states have internal predecessors, (56740), 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:46:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54560 states to 54560 states and 56740 transitions. [2025-02-05 10:46:09,214 INFO L78 Accepts]: Start accepts. Automaton has 54560 states and 56740 transitions. Word has length 455 [2025-02-05 10:46:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:09,214 INFO L471 AbstractCegarLoop]: Abstraction has 54560 states and 56740 transitions. [2025-02-05 10:46:09,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:46:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54560 states and 56740 transitions. [2025-02-05 10:46:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-02-05 10:46:09,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:09,231 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:09,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 10:46:09,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:09,432 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:09,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash -379832012, now seen corresponding path program 1 times [2025-02-05 10:46:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762391823] [2025-02-05 10:46:09,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-02-05 10:46:09,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-02-05 10:46:09,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:09,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 10:46:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762391823] [2025-02-05 10:46:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762391823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:46:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:46:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86184548] [2025-02-05 10:46:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:46:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:46:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:46:09,896 INFO L87 Difference]: Start difference. First operand 54560 states and 56740 transitions. Second operand has 4 states, 4 states have (on average 83.5) 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:46:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:10,757 INFO L93 Difference]: Finished difference Result 112225 states and 116762 transitions. [2025-02-05 10:46:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:46:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) 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 490 [2025-02-05 10:46:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:10,817 INFO L225 Difference]: With dead ends: 112225 [2025-02-05 10:46:10,817 INFO L226 Difference]: Without dead ends: 58073 [2025-02-05 10:46:10,849 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:46:10,850 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 275 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:10,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 87 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:46:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58073 states. [2025-02-05 10:46:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58073 to 54560. [2025-02-05 10:46:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54560 states, 54559 states have (on average 1.0398101138217342) internal successors, (56731), 54559 states have internal predecessors, (56731), 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:46:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54560 states to 54560 states and 56731 transitions. [2025-02-05 10:46:11,475 INFO L78 Accepts]: Start accepts. Automaton has 54560 states and 56731 transitions. Word has length 490 [2025-02-05 10:46:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 54560 states and 56731 transitions. [2025-02-05 10:46:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) 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:46:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 54560 states and 56731 transitions. [2025-02-05 10:46:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 10:46:11,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:11,488 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-02-05 10:46:11,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:46:11,488 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1740321129, now seen corresponding path program 1 times [2025-02-05 10:46:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:11,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935129145] [2025-02-05 10:46:11,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:11,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 10:46:11,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 10:46:11,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:11,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 586 proven. 18 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-02-05 10:46:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935129145] [2025-02-05 10:46:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935129145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521970759] [2025-02-05 10:46:11,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:11,934 INFO L229 MonitoredProcess]: Starting monitored process 11 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:46:11,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:46:12,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 10:46:12,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 10:46:12,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:12,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:12,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:46:12,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-02-05 10:46:12,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521970759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:12,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:12,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 10:46:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807152266] [2025-02-05 10:46:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:12,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:12,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:12,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:12,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:12,430 INFO L87 Difference]: Start difference. First operand 54560 states and 56731 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 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:46:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:12,953 INFO L93 Difference]: Finished difference Result 153483 states and 159663 transitions. [2025-02-05 10:46:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 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 502 [2025-02-05 10:46:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:13,071 INFO L225 Difference]: With dead ends: 153483 [2025-02-05 10:46:13,071 INFO L226 Difference]: Without dead ends: 99737 [2025-02-05 10:46:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:46:13,120 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 155 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 458 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:46:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99737 states. [2025-02-05 10:46:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99737 to 97900. [2025-02-05 10:46:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97900 states, 97899 states have (on average 1.0406030705114455) internal successors, (101874), 97899 states have internal predecessors, (101874), 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:46:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97900 states to 97900 states and 101874 transitions. [2025-02-05 10:46:14,125 INFO L78 Accepts]: Start accepts. Automaton has 97900 states and 101874 transitions. Word has length 502 [2025-02-05 10:46:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:14,125 INFO L471 AbstractCegarLoop]: Abstraction has 97900 states and 101874 transitions. [2025-02-05 10:46:14,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 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:46:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 97900 states and 101874 transitions. [2025-02-05 10:46:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 10:46:14,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:14,140 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 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] [2025-02-05 10:46:14,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:46:14,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 10:46:14,345 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -758093412, now seen corresponding path program 1 times [2025-02-05 10:46:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925169699] [2025-02-05 10:46:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 10:46:14,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 10:46:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 510 proven. 61 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 10:46:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925169699] [2025-02-05 10:46:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925169699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642111214] [2025-02-05 10:46:15,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:15,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:15,532 INFO L229 MonitoredProcess]: Starting monitored process 12 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:46:15,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:46:15,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 10:46:15,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 10:46:15,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:15,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:46:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-02-05 10:46:15,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642111214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:15,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 10:46:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070136605] [2025-02-05 10:46:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:15,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:46:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:15,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:46:15,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:46:15,775 INFO L87 Difference]: Start difference. First operand 97900 states and 101874 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:46:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:16,299 INFO L93 Difference]: Finished difference Result 223885 states and 233104 transitions. [2025-02-05 10:46:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:46:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 538 [2025-02-05 10:46:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:16,440 INFO L225 Difference]: With dead ends: 223885 [2025-02-05 10:46:16,441 INFO L226 Difference]: Without dead ends: 121926 [2025-02-05 10:46:16,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:46:16,509 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 222 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:16,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 736 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:46:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121926 states. [2025-02-05 10:46:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121926 to 120907. [2025-02-05 10:46:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120907 states, 120906 states have (on average 1.039849139000546) internal successors, (125724), 120906 states have internal predecessors, (125724), 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:46:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120907 states to 120907 states and 125724 transitions. [2025-02-05 10:46:17,624 INFO L78 Accepts]: Start accepts. Automaton has 120907 states and 125724 transitions. Word has length 538 [2025-02-05 10:46:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:46:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 120907 states and 125724 transitions. [2025-02-05 10:46:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:46:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 120907 states and 125724 transitions. [2025-02-05 10:46:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-05 10:46:17,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:46:17,640 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:17,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:46:17,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 10:46:17,840 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:46:17,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:46:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1699957745, now seen corresponding path program 1 times [2025-02-05 10:46:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:46:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445645315] [2025-02-05 10:46:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:46:17,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-05 10:46:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-05 10:46:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 605 proven. 124 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-02-05 10:46:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:46:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445645315] [2025-02-05 10:46:18,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445645315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:46:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635136833] [2025-02-05 10:46:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:46:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:46:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:46:18,415 INFO L229 MonitoredProcess]: Starting monitored process 13 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:46:18,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:46:18,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-05 10:46:18,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-05 10:46:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:46:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:46:18,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:46:18,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:46:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-05 10:46:19,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:46:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635136833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:46:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:46:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:46:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785821280] [2025-02-05 10:46:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:46:19,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:46:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:46:19,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:46:19,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:46:19,041 INFO L87 Difference]: Start difference. First operand 120907 states and 125724 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 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:46:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:46:20,828 INFO L93 Difference]: Finished difference Result 340224 states and 353822 transitions. [2025-02-05 10:46:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:46:20,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 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 551 [2025-02-05 10:46:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:46:21,117 INFO L225 Difference]: With dead ends: 340224 [2025-02-05 10:46:21,117 INFO L226 Difference]: Without dead ends: 219319 [2025-02-05 10:46:21,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:46:21,192 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 469 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:46:21,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 279 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]