./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label09.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/Problem17_label09.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 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:01:31,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:01:31,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:01:31,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:01:31,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:01:31,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:01:31,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:01:31,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:01:31,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:01:31,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:01:31,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:01:31,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:01:31,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:01:31,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:01:31,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:01:31,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:01:31,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:31,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:01:31,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:01:31,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:01:31,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:01:31,997 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 -> 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 [2025-02-05 12:01:32,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:01:32,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:01:32,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:01:32,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:01:32,285 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:01:32,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2025-02-05 12:01:33,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4677d6d42/91f9920c1b244922924d9cbb70602d99/FLAG82659076b [2025-02-05 12:01:34,147 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:01:34,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2025-02-05 12:01:34,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4677d6d42/91f9920c1b244922924d9cbb70602d99/FLAG82659076b [2025-02-05 12:01:34,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4677d6d42/91f9920c1b244922924d9cbb70602d99 [2025-02-05 12:01:34,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:01:34,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:01:34,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:34,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:01:34,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:01:34,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:34" (1/1) ... [2025-02-05 12:01:34,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ca1bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:34, skipping insertion in model container [2025-02-05 12:01:34,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:34" (1/1) ... [2025-02-05 12:01:34,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:01:34,471 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/Problem17_label09.c[1938,1951] [2025-02-05 12:01:34,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:34,970 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:01:34,983 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/Problem17_label09.c[1938,1951] [2025-02-05 12:01:35,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:35,308 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:01:35,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35 WrapperNode [2025-02-05 12:01:35,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:35,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:35,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:01:35,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:01:35,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,570 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:01:35,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:35,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:01:35,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:01:35,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:01:35,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,810 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 12:01:35,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:35,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:36,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:01:36,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:01:36,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:01:36,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:01:36,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (1/1) ... [2025-02-05 12:01:36,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:36,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:36,085 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 12:01:36,088 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 12:01:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:01:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:01:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:01:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:01:36,179 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:01:36,181 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:01:39,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:01:39,146 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:01:39,146 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:01:39,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:01:39,178 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:01:39,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:39 BoogieIcfgContainer [2025-02-05 12:01:39,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:01:39,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:01:39,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:01:39,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:01:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:34" (1/3) ... [2025-02-05 12:01:39,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d8068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:39, skipping insertion in model container [2025-02-05 12:01:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:35" (2/3) ... [2025-02-05 12:01:39,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d8068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:39, skipping insertion in model container [2025-02-05 12:01:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:39" (3/3) ... [2025-02-05 12:01:39,187 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label09.c [2025-02-05 12:01:39,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:01:39,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label09.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:01:39,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:01:39,260 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;@294e37ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:01:39,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:01:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 12:01:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:01:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:39,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:39,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1063681909, now seen corresponding path program 1 times [2025-02-05 12:01:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:39,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559884887] [2025-02-05 12:01:39,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:01:39,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:01:39,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:39,490 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 12:01:39,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:39,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559884887] [2025-02-05 12:01:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559884887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546576830] [2025-02-05 12:01:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:39,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:39,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:39,511 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:41,939 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-02-05 12:01:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 12:01:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:41,955 INFO L225 Difference]: With dead ends: 1667 [2025-02-05 12:01:41,958 INFO L226 Difference]: Without dead ends: 998 [2025-02-05 12:01:41,962 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 12:01:41,967 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 533 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:41,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:01:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-05 12:01:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-02-05 12:01:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 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 12:01:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-02-05 12:01:42,053 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 12 [2025-02-05 12:01:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:42,055 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-02-05 12:01:42,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-02-05 12:01:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 12:01:42,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:42,057 INFO L218 NwaCegarLoop]: trace histogram [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 12:01:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:01:42,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:42,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1139495068, now seen corresponding path program 1 times [2025-02-05 12:01:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:42,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999364374] [2025-02-05 12:01:42,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:42,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 12:01:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 12:01:42,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:42,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999364374] [2025-02-05 12:01:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999364374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:42,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:42,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458726528] [2025-02-05 12:01:42,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:42,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:42,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:42,318 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 12:01:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:44,127 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-02-05 12:01:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-05 12:01:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:44,135 INFO L225 Difference]: With dead ends: 2824 [2025-02-05 12:01:44,135 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:01:44,137 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 12:01:44,137 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:44,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:01:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:01:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-02-05 12:01:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 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 12:01:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-02-05 12:01:44,179 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 77 [2025-02-05 12:01:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-02-05 12:01:44,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 12:01:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-02-05 12:01:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 12:01:44,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:44,182 INFO L218 NwaCegarLoop]: trace histogram [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, 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 12:01:44,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:01:44,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:44,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 112977572, now seen corresponding path program 1 times [2025-02-05 12:01:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:44,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183583196] [2025-02-05 12:01:44,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 12:01:44,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 12:01:44,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:44,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183583196] [2025-02-05 12:01:44,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183583196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:44,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:44,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905217992] [2025-02-05 12:01:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:44,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:44,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:44,561 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 12:01:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:46,330 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-02-05 12:01:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-05 12:01:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:46,345 INFO L225 Difference]: With dead ends: 4546 [2025-02-05 12:01:46,345 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 12:01:46,352 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 12:01:46,356 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:46,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:01:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 12:01:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-02-05 12:01:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 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 12:01:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-02-05 12:01:46,447 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 160 [2025-02-05 12:01:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-02-05 12:01:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 12:01:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-02-05 12:01:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 12:01:46,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:46,454 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:01:46,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:01:46,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1469681269, now seen corresponding path program 1 times [2025-02-05 12:01:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:46,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931131392] [2025-02-05 12:01:46,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:46,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 12:01:46,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 12:01:46,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:46,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:01:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931131392] [2025-02-05 12:01:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931131392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303418681] [2025-02-05 12:01:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:46,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:46,747 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 12:01:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:48,551 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-02-05 12:01:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 166 [2025-02-05 12:01:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:48,568 INFO L225 Difference]: With dead ends: 7954 [2025-02-05 12:01:48,568 INFO L226 Difference]: Without dead ends: 5252 [2025-02-05 12:01:48,573 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 12:01:48,577 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 436 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:48,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:01:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-02-05 12:01:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-02-05 12:01:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 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 12:01:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-02-05 12:01:48,654 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 166 [2025-02-05 12:01:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:48,655 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-02-05 12:01:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 12:01:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-02-05 12:01:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 12:01:48,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:48,657 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:01:48,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1774568719, now seen corresponding path program 1 times [2025-02-05 12:01:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129813339] [2025-02-05 12:01:48,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:48,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 12:01:48,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 12:01:48,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129813339] [2025-02-05 12:01:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129813339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363443480] [2025-02-05 12:01:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:48,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:48,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:48,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:48,856 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 12:01:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:51,303 INFO L93 Difference]: Finished difference Result 12204 states and 15757 transitions. [2025-02-05 12:01:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 179 [2025-02-05 12:01:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:51,326 INFO L225 Difference]: With dead ends: 12204 [2025-02-05 12:01:51,326 INFO L226 Difference]: Without dead ends: 7380 [2025-02-05 12:01:51,334 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 12:01:51,335 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 460 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:51,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 512 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:01:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2025-02-05 12:01:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 6525. [2025-02-05 12:01:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6525 states, 6524 states have (on average 1.2665542611894542) internal successors, (8263), 6524 states have internal predecessors, (8263), 0 states have call successors, (0), 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 12:01:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 8263 transitions. [2025-02-05 12:01:51,443 INFO L78 Accepts]: Start accepts. Automaton has 6525 states and 8263 transitions. Word has length 179 [2025-02-05 12:01:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 6525 states and 8263 transitions. [2025-02-05 12:01:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 12:01:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6525 states and 8263 transitions. [2025-02-05 12:01:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 12:01:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:51,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:51,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:01:51,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 534631367, now seen corresponding path program 1 times [2025-02-05 12:01:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074370809] [2025-02-05 12:01:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 12:01:51,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 12:01:51,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:51,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:51,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:51,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074370809] [2025-02-05 12:01:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074370809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:51,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80110003] [2025-02-05 12:01:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:51,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:51,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:51,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:51,695 INFO L87 Difference]: Start difference. First operand 6525 states and 8263 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 12:01:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:54,079 INFO L93 Difference]: Finished difference Result 17751 states and 22351 transitions. [2025-02-05 12:01:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-02-05 12:01:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:54,108 INFO L225 Difference]: With dead ends: 17751 [2025-02-05 12:01:54,108 INFO L226 Difference]: Without dead ends: 9951 [2025-02-05 12:01:54,117 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 12:01:54,117 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 488 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:54,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1019 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:01:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2025-02-05 12:01:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 9943. [2025-02-05 12:01:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9943 states, 9942 states have (on average 1.208006437336552) internal successors, (12010), 9942 states have internal predecessors, (12010), 0 states have call successors, (0), 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 12:01:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 12010 transitions. [2025-02-05 12:01:54,255 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 12010 transitions. Word has length 228 [2025-02-05 12:01:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:54,255 INFO L471 AbstractCegarLoop]: Abstraction has 9943 states and 12010 transitions. [2025-02-05 12:01:54,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 12:01:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 12010 transitions. [2025-02-05 12:01:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 12:01:54,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:54,263 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:54,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:01:54,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 53017725, now seen corresponding path program 1 times [2025-02-05 12:01:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358383570] [2025-02-05 12:01:54,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:54,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 12:01:54,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 12:01:54,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:54,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358383570] [2025-02-05 12:01:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358383570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898193473] [2025-02-05 12:01:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:54,514 INFO L87 Difference]: Start difference. First operand 9943 states and 12010 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 12:01:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:56,087 INFO L93 Difference]: Finished difference Result 20736 states and 24968 transitions. [2025-02-05 12:01:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 12:01:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:56,112 INFO L225 Difference]: With dead ends: 20736 [2025-02-05 12:01:56,114 INFO L226 Difference]: Without dead ends: 10795 [2025-02-05 12:01:56,125 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 12:01:56,126 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 418 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:56,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 985 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2025-02-05 12:01:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10369. [2025-02-05 12:01:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10369 states, 10368 states have (on average 1.2040895061728396) internal successors, (12484), 10368 states have internal predecessors, (12484), 0 states have call successors, (0), 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 12:01:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10369 states to 10369 states and 12484 transitions. [2025-02-05 12:01:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10369 states and 12484 transitions. Word has length 232 [2025-02-05 12:01:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:56,271 INFO L471 AbstractCegarLoop]: Abstraction has 10369 states and 12484 transitions. [2025-02-05 12:01:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 12:01:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10369 states and 12484 transitions. [2025-02-05 12:01:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-05 12:01:56,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:56,276 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:56,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:01:56,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:56,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 735947229, now seen corresponding path program 1 times [2025-02-05 12:01:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228358184] [2025-02-05 12:01:56,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:56,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-05 12:01:56,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-05 12:01:56,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 158 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:01:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:56,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228358184] [2025-02-05 12:01:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228358184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:56,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372889346] [2025-02-05 12:01:56,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:56,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:56,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:56,736 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 12:01:56,738 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 12:01:56,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-05 12:01:56,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-05 12:01:56,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:56,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:01:56,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 158 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:01:57,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:01:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372889346] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:01:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:01:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460834847] [2025-02-05 12:01:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:57,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:57,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:01:57,295 INFO L87 Difference]: Start difference. First operand 10369 states and 12484 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 12:02:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:00,447 INFO L93 Difference]: Finished difference Result 30985 states and 37761 transitions. [2025-02-05 12:02:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:00,451 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 236 [2025-02-05 12:02:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:00,475 INFO L225 Difference]: With dead ends: 30985 [2025-02-05 12:02:00,476 INFO L226 Difference]: Without dead ends: 19753 [2025-02-05 12:02:00,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:02:00,485 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 908 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:00,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 157 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 12:02:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2025-02-05 12:02:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 19752. [2025-02-05 12:02:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19752 states, 19751 states have (on average 1.158321097665941) internal successors, (22878), 19751 states have internal predecessors, (22878), 0 states have call successors, (0), 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 12:02:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19752 states to 19752 states and 22878 transitions. [2025-02-05 12:02:00,717 INFO L78 Accepts]: Start accepts. Automaton has 19752 states and 22878 transitions. Word has length 236 [2025-02-05 12:02:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:00,717 INFO L471 AbstractCegarLoop]: Abstraction has 19752 states and 22878 transitions. [2025-02-05 12:02:00,717 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 12:02:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19752 states and 22878 transitions. [2025-02-05 12:02:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 12:02:00,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:00,720 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:00,731 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 12:02:00,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:00,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1512215383, now seen corresponding path program 1 times [2025-02-05 12:02:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:00,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300817857] [2025-02-05 12:02:00,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:00,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 12:02:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 12:02:00,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300817857] [2025-02-05 12:02:01,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300817857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331563692] [2025-02-05 12:02:01,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:01,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:01,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:01,085 INFO L87 Difference]: Start difference. First operand 19752 states and 22878 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 12:02:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:02,407 INFO L93 Difference]: Finished difference Result 42479 states and 49308 transitions. [2025-02-05 12:02:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:02,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 249 [2025-02-05 12:02:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:02,436 INFO L225 Difference]: With dead ends: 42479 [2025-02-05 12:02:02,437 INFO L226 Difference]: Without dead ends: 22729 [2025-02-05 12:02:02,452 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 12:02:02,453 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 378 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:02,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 856 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:02:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22729 states. [2025-02-05 12:02:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22729 to 22303. [2025-02-05 12:02:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22303 states, 22302 states have (on average 1.1478342749529191) internal successors, (25599), 22302 states have internal predecessors, (25599), 0 states have call successors, (0), 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 12:02:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22303 states to 22303 states and 25599 transitions. [2025-02-05 12:02:02,623 INFO L78 Accepts]: Start accepts. Automaton has 22303 states and 25599 transitions. Word has length 249 [2025-02-05 12:02:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:02,624 INFO L471 AbstractCegarLoop]: Abstraction has 22303 states and 25599 transitions. [2025-02-05 12:02:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 12:02:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22303 states and 25599 transitions. [2025-02-05 12:02:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 12:02:02,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:02,627 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 12:02:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:02:02,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:02,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1019276028, now seen corresponding path program 1 times [2025-02-05 12:02:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328460936] [2025-02-05 12:02:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:02,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 12:02:02,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 12:02:02,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:02,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:02:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328460936] [2025-02-05 12:02:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328460936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:02,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931811618] [2025-02-05 12:02:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:02,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:02,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:02,957 INFO L87 Difference]: Start difference. First operand 22303 states and 25599 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:02:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:05,801 INFO L93 Difference]: Finished difference Result 56130 states and 65063 transitions. [2025-02-05 12:02:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:02:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:05,893 INFO L225 Difference]: With dead ends: 56130 [2025-02-05 12:02:05,893 INFO L226 Difference]: Without dead ends: 30848 [2025-02-05 12:02:05,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:05,933 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 902 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:05,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 344 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 12:02:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30848 states. [2025-02-05 12:02:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30848 to 29526. [2025-02-05 12:02:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29526 states, 29525 states have (on average 1.159424216765453) internal successors, (34232), 29525 states have internal predecessors, (34232), 0 states have call successors, (0), 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 12:02:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29526 states to 29526 states and 34232 transitions. [2025-02-05 12:02:06,303 INFO L78 Accepts]: Start accepts. Automaton has 29526 states and 34232 transitions. Word has length 272 [2025-02-05 12:02:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:06,304 INFO L471 AbstractCegarLoop]: Abstraction has 29526 states and 34232 transitions. [2025-02-05 12:02:06,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:02:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 29526 states and 34232 transitions. [2025-02-05 12:02:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 12:02:06,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:06,307 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 12:02:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:02:06,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1028652163, now seen corresponding path program 1 times [2025-02-05 12:02:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8926852] [2025-02-05 12:02:06,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:06,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 12:02:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 12:02:06,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:02:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8926852] [2025-02-05 12:02:06,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8926852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:06,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:06,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:06,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352873529] [2025-02-05 12:02:06,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:06,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:06,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:06,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:06,475 INFO L87 Difference]: Start difference. First operand 29526 states and 34232 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 12:02:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:08,087 INFO L93 Difference]: Finished difference Result 74398 states and 86009 transitions. [2025-02-05 12:02:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 287 [2025-02-05 12:02:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:08,139 INFO L225 Difference]: With dead ends: 74398 [2025-02-05 12:02:08,140 INFO L226 Difference]: Without dead ends: 41896 [2025-02-05 12:02:08,168 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 12:02:08,170 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 363 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:08,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 808 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:02:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41896 states. [2025-02-05 12:02:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41896 to 41037. [2025-02-05 12:02:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41037 states, 41036 states have (on average 1.1224047178087533) internal successors, (46059), 41036 states have internal predecessors, (46059), 0 states have call successors, (0), 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 12:02:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41037 states to 41037 states and 46059 transitions. [2025-02-05 12:02:08,739 INFO L78 Accepts]: Start accepts. Automaton has 41037 states and 46059 transitions. Word has length 287 [2025-02-05 12:02:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:08,739 INFO L471 AbstractCegarLoop]: Abstraction has 41037 states and 46059 transitions. [2025-02-05 12:02:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 12:02:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41037 states and 46059 transitions. [2025-02-05 12:02:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 12:02:08,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:08,742 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:02:08,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2101264063, now seen corresponding path program 1 times [2025-02-05 12:02:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:08,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400338802] [2025-02-05 12:02:08,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:08,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 12:02:08,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 12:02:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 238 proven. 214 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:02:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400338802] [2025-02-05 12:02:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400338802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627397260] [2025-02-05 12:02:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:08,981 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 12:02:08,984 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 12:02:09,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 12:02:09,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 12:02:09,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:09,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:09,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:02:09,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 299 proven. 73 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 12:02:09,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 12:02:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627397260] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:09,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:02:09,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-02-05 12:02:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047664304] [2025-02-05 12:02:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:09,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:09,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:09,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:09,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:02:09,441 INFO L87 Difference]: Start difference. First operand 41037 states and 46059 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 12:02:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:12,221 INFO L93 Difference]: Finished difference Result 97844 states and 109929 transitions. [2025-02-05 12:02:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 310 [2025-02-05 12:02:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:12,305 INFO L225 Difference]: With dead ends: 97844 [2025-02-05 12:02:12,305 INFO L226 Difference]: Without dead ends: 56809 [2025-02-05 12:02:12,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:02:12,342 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 907 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:12,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 185 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:02:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56809 states. [2025-02-05 12:02:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56809 to 53829. [2025-02-05 12:02:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53829 states, 53828 states have (on average 1.126216838819945) internal successors, (60622), 53828 states have internal predecessors, (60622), 0 states have call successors, (0), 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 12:02:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53829 states to 53829 states and 60622 transitions. [2025-02-05 12:02:13,271 INFO L78 Accepts]: Start accepts. Automaton has 53829 states and 60622 transitions. Word has length 310 [2025-02-05 12:02:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:13,272 INFO L471 AbstractCegarLoop]: Abstraction has 53829 states and 60622 transitions. [2025-02-05 12:02:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 12:02:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 53829 states and 60622 transitions. [2025-02-05 12:02:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-05 12:02:13,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:13,276 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:13,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 12:02:13,480 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 12:02:13,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1595762548, now seen corresponding path program 1 times [2025-02-05 12:02:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336717992] [2025-02-05 12:02:13,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-05 12:02:13,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-05 12:02:13,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:13,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:02:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336717992] [2025-02-05 12:02:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336717992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684818936] [2025-02-05 12:02:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:13,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:13,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:13,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:13,683 INFO L87 Difference]: Start difference. First operand 53829 states and 60622 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:15,476 INFO L93 Difference]: Finished difference Result 115335 states and 130060 transitions. [2025-02-05 12:02:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-02-05 12:02:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:15,562 INFO L225 Difference]: With dead ends: 115335 [2025-02-05 12:02:15,563 INFO L226 Difference]: Without dead ends: 61078 [2025-02-05 12:02:15,606 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 12:02:15,607 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 504 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 310 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61078 states. [2025-02-05 12:02:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61078 to 59370. [2025-02-05 12:02:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59370 states, 59369 states have (on average 1.1245262679176) internal successors, (66762), 59369 states have internal predecessors, (66762), 0 states have call successors, (0), 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 12:02:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59370 states to 59370 states and 66762 transitions. [2025-02-05 12:02:16,437 INFO L78 Accepts]: Start accepts. Automaton has 59370 states and 66762 transitions. Word has length 324 [2025-02-05 12:02:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:16,438 INFO L471 AbstractCegarLoop]: Abstraction has 59370 states and 66762 transitions. [2025-02-05 12:02:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59370 states and 66762 transitions. [2025-02-05 12:02:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 12:02:16,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:16,446 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-02-05 12:02:16,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:02:16,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1558147625, now seen corresponding path program 1 times [2025-02-05 12:02:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459075304] [2025-02-05 12:02:16,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 12:02:16,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 12:02:16,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-02-05 12:02:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:17,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459075304] [2025-02-05 12:02:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459075304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823969425] [2025-02-05 12:02:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:17,045 INFO L87 Difference]: Start difference. First operand 59370 states and 66762 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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 12:02:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:18,975 INFO L93 Difference]: Finished difference Result 134905 states and 151659 transitions. [2025-02-05 12:02:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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 340 [2025-02-05 12:02:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:19,088 INFO L225 Difference]: With dead ends: 134905 [2025-02-05 12:02:19,089 INFO L226 Difference]: Without dead ends: 72558 [2025-02-05 12:02:19,129 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 12:02:19,130 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:19,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 834 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:02:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-02-05 12:02:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 61033. [2025-02-05 12:02:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61033 states, 61032 states have (on average 1.1192489186000787) internal successors, (68310), 61032 states have internal predecessors, (68310), 0 states have call successors, (0), 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 12:02:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61033 states to 61033 states and 68310 transitions. [2025-02-05 12:02:20,174 INFO L78 Accepts]: Start accepts. Automaton has 61033 states and 68310 transitions. Word has length 340 [2025-02-05 12:02:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:20,178 INFO L471 AbstractCegarLoop]: Abstraction has 61033 states and 68310 transitions. [2025-02-05 12:02:20,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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 12:02:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 61033 states and 68310 transitions. [2025-02-05 12:02:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-05 12:02:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:20,181 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:02:20,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -136791947, now seen corresponding path program 1 times [2025-02-05 12:02:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47799294] [2025-02-05 12:02:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:20,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 12:02:20,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 12:02:20,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:20,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:02:20,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:20,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47799294] [2025-02-05 12:02:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47799294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:20,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922031736] [2025-02-05 12:02:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:20,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:20,337 INFO L87 Difference]: Start difference. First operand 61033 states and 68310 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 12:02:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:22,142 INFO L93 Difference]: Finished difference Result 137375 states and 153487 transitions. [2025-02-05 12:02:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 345 [2025-02-05 12:02:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:22,240 INFO L225 Difference]: With dead ends: 137375 [2025-02-05 12:02:22,241 INFO L226 Difference]: Without dead ends: 71232 [2025-02-05 12:02:22,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:22,289 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 482 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:22,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 724 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71232 states. [2025-02-05 12:02:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71232 to 71223. [2025-02-05 12:02:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71223 states, 71222 states have (on average 1.0991968773693521) internal successors, (78287), 71222 states have internal predecessors, (78287), 0 states have call successors, (0), 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 12:02:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71223 states to 71223 states and 78287 transitions. [2025-02-05 12:02:23,445 INFO L78 Accepts]: Start accepts. Automaton has 71223 states and 78287 transitions. Word has length 345 [2025-02-05 12:02:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:23,445 INFO L471 AbstractCegarLoop]: Abstraction has 71223 states and 78287 transitions. [2025-02-05 12:02:23,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 12:02:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 71223 states and 78287 transitions. [2025-02-05 12:02:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 12:02:23,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:23,449 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 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 12:02:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:02:23,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:23,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash 131639642, now seen corresponding path program 1 times [2025-02-05 12:02:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386334271] [2025-02-05 12:02:23,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 12:02:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 12:02:23,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 12:02:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386334271] [2025-02-05 12:02:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386334271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839483706] [2025-02-05 12:02:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:23,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:23,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:23,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:23,968 INFO L87 Difference]: Start difference. First operand 71223 states and 78287 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 12:02:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:26,014 INFO L93 Difference]: Finished difference Result 157773 states and 173760 transitions. [2025-02-05 12:02:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 12:02:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:26,282 INFO L225 Difference]: With dead ends: 157773 [2025-02-05 12:02:26,282 INFO L226 Difference]: Without dead ends: 86552 [2025-02-05 12:02:26,308 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 12:02:26,309 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 412 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:26,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 299 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:02:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86552 states. [2025-02-05 12:02:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86552 to 79305. [2025-02-05 12:02:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79305 states, 79304 states have (on average 1.0928956925249673) internal successors, (86671), 79304 states have internal predecessors, (86671), 0 states have call successors, (0), 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 12:02:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79305 states to 79305 states and 86671 transitions. [2025-02-05 12:02:27,289 INFO L78 Accepts]: Start accepts. Automaton has 79305 states and 86671 transitions. Word has length 358 [2025-02-05 12:02:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 79305 states and 86671 transitions. [2025-02-05 12:02:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 12:02:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 79305 states and 86671 transitions. [2025-02-05 12:02:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-05 12:02:27,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:27,296 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-02-05 12:02:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:02:27,296 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1235204759, now seen corresponding path program 1 times [2025-02-05 12:02:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002309650] [2025-02-05 12:02:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:27,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 12:02:27,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 12:02:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 244 proven. 10 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:02:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002309650] [2025-02-05 12:02:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002309650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380178512] [2025-02-05 12:02:27,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:27,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:27,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:27,890 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 12:02:27,955 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 12:02:28,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 12:02:28,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 12:02:28,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:28,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:28,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:02:28,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 12:02:28,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 12:02:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380178512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:02:29,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:02:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:02:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080905536] [2025-02-05 12:02:29,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:02:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 12:02:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 12:02:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:02:29,090 INFO L87 Difference]: Start difference. First operand 79305 states and 86671 transitions. Second operand has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 0 states have call successors, (0), 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 12:02:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:39,403 INFO L93 Difference]: Finished difference Result 198639 states and 215925 transitions. [2025-02-05 12:02:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 12:02:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 0 states have call successors, (0), 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 392 [2025-02-05 12:02:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:39,564 INFO L225 Difference]: With dead ends: 198639 [2025-02-05 12:02:39,564 INFO L226 Difference]: Without dead ends: 116359 [2025-02-05 12:02:39,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-02-05 12:02:39,621 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 12027 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 11742 mSolverCounterSat, 2816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12027 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 14558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2816 IncrementalHoareTripleChecker+Valid, 11742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:39,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12027 Valid, 401 Invalid, 14558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2816 Valid, 11742 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-02-05 12:02:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116359 states. [2025-02-05 12:02:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116359 to 94180. [2025-02-05 12:02:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94180 states, 94179 states have (on average 1.077246519924824) internal successors, (101454), 94179 states have internal predecessors, (101454), 0 states have call successors, (0), 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 12:02:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94180 states to 94180 states and 101454 transitions. [2025-02-05 12:02:41,297 INFO L78 Accepts]: Start accepts. Automaton has 94180 states and 101454 transitions. Word has length 392 [2025-02-05 12:02:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:41,297 INFO L471 AbstractCegarLoop]: Abstraction has 94180 states and 101454 transitions. [2025-02-05 12:02:41,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 0 states have call successors, (0), 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 12:02:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 94180 states and 101454 transitions. [2025-02-05 12:02:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-05 12:02:41,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:41,303 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:02:41,309 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 12:02:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:41,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:41,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash 329430664, now seen corresponding path program 1 times [2025-02-05 12:02:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785515711] [2025-02-05 12:02:41,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:41,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 12:02:41,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 12:02:41,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:41,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 12:02:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785515711] [2025-02-05 12:02:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785515711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983410716] [2025-02-05 12:02:42,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:42,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:42,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:42,287 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 12:02:42,288 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 12:02:42,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 12:02:42,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 12:02:42,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:42,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 12:02:42,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 12:02:43,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 454 proven. 1 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 12:02:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983410716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:02:44,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:02:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-05 12:02:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695296709] [2025-02-05 12:02:44,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:02:44,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:02:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:44,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:02:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:02:44,760 INFO L87 Difference]: Start difference. First operand 94180 states and 101454 transitions. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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 12:02:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:49,615 INFO L93 Difference]: Finished difference Result 203485 states and 219051 transitions. [2025-02-05 12:02:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 12:02:49,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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 500 [2025-02-05 12:02:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:49,730 INFO L225 Difference]: With dead ends: 203485 [2025-02-05 12:02:49,731 INFO L226 Difference]: Without dead ends: 109307 [2025-02-05 12:02:49,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-05 12:02:49,758 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 2905 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6595 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2905 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 6595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:49,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2905 Valid, 398 Invalid, 7426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 6595 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 12:02:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109307 states. [2025-02-05 12:02:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109307 to 92472. [2025-02-05 12:02:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92472 states, 92471 states have (on average 1.0762617469260634) internal successors, (99523), 92471 states have internal predecessors, (99523), 0 states have call successors, (0), 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 12:02:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92472 states to 92472 states and 99523 transitions. [2025-02-05 12:02:50,627 INFO L78 Accepts]: Start accepts. Automaton has 92472 states and 99523 transitions. Word has length 500 [2025-02-05 12:02:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 92472 states and 99523 transitions. [2025-02-05 12:02:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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 12:02:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 92472 states and 99523 transitions. [2025-02-05 12:02:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-02-05 12:02:50,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:50,633 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:50,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 12:02:50,834 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,SelfDestructingSolverStorable17 [2025-02-05 12:02:50,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1328084619, now seen corresponding path program 1 times [2025-02-05 12:02:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442826675] [2025-02-05 12:02:50,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-02-05 12:02:51,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-02-05 12:02:51,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:51,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442826675] [2025-02-05 12:02:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442826675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67748182] [2025-02-05 12:02:51,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:51,569 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 12:02:51,574 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 12:02:51,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-02-05 12:02:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-02-05 12:02:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:51,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:02:51,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 244 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:51,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67748182] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:02:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-02-05 12:02:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091624012] [2025-02-05 12:02:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:52,074 INFO L87 Difference]: Start difference. First operand 92472 states and 99523 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 12:02:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:54,856 INFO L93 Difference]: Finished difference Result 199001 states and 214092 transitions. [2025-02-05 12:02:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 579 [2025-02-05 12:02:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:54,974 INFO L225 Difference]: With dead ends: 199001 [2025-02-05 12:02:54,974 INFO L226 Difference]: Without dead ends: 105681 [2025-02-05 12:02:55,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1154 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:55,035 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 990 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:55,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 140 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:02:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105681 states. [2025-02-05 12:02:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105681 to 101414. [2025-02-05 12:02:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101414 states, 101413 states have (on average 1.0779485864731346) internal successors, (109318), 101413 states have internal predecessors, (109318), 0 states have call successors, (0), 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 12:02:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101414 states to 101414 states and 109318 transitions. [2025-02-05 12:02:56,457 INFO L78 Accepts]: Start accepts. Automaton has 101414 states and 109318 transitions. Word has length 579 [2025-02-05 12:02:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 101414 states and 109318 transitions. [2025-02-05 12:02:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 12:02:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 101414 states and 109318 transitions. [2025-02-05 12:02:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-02-05 12:02:56,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:56,476 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:56,486 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 12:02:56,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:56,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2008846683, now seen corresponding path program 1 times [2025-02-05 12:02:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547653028] [2025-02-05 12:02:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-05 12:02:56,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-05 12:02:56,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547653028] [2025-02-05 12:02:57,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547653028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:57,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612720365] [2025-02-05 12:02:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:57,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:57,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:57,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:57,389 INFO L87 Difference]: Start difference. First operand 101414 states and 109318 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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 12:02:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:59,286 INFO L93 Difference]: Finished difference Result 210502 states and 226986 transitions. [2025-02-05 12:02:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:59,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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 667 [2025-02-05 12:02:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted.