./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pnr2.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/array-tiling/pnr2.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 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:07:19,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:07:19,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:07:19,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:07:19,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:07:19,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:07:19,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:07:19,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:07:19,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:07:19,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:07:19,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:07:19,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:07:19,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:07:19,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:07:19,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:07:19,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:07:19,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:07:19,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:07:19,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:07:19,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:07:19,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:07:19,315 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 -> 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f [2025-02-05 10:07:19,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:07:19,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:07:19,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:07:19,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:07:19,525 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:07:19,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr2.c [2025-02-05 10:07:20,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37a8d2216/2e7d56429b3f40f39975ea7014a36e95/FLAGc2f69cc80 [2025-02-05 10:07:20,994 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:07:21,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr2.c [2025-02-05 10:07:21,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37a8d2216/2e7d56429b3f40f39975ea7014a36e95/FLAGc2f69cc80 [2025-02-05 10:07:21,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37a8d2216/2e7d56429b3f40f39975ea7014a36e95 [2025-02-05 10:07:21,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:07:21,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:07:21,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:07:21,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:07:21,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:07:21,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3640cd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21, skipping insertion in model container [2025-02-05 10:07:21,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:07:21,443 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/array-tiling/pnr2.c[395,408] [2025-02-05 10:07:21,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:07:21,460 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:07:21,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/array-tiling/pnr2.c[395,408] [2025-02-05 10:07:21,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:07:21,492 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:07:21,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21 WrapperNode [2025-02-05 10:07:21,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:07:21,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:07:21,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:07:21,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:07:21,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,518 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-02-05 10:07:21,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:07:21,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:07:21,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:07:21,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:07:21,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,537 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7]. The 4 writes are split as follows [0, 4, 0]. [2025-02-05 10:07:21,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:07:21,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:07:21,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:07:21,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:07:21,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (1/1) ... [2025-02-05 10:07:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:07:21,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:21,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:07:21,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:07:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:07:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:07:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:07:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-02-05 10:07:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:07:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:07:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:07:21,628 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:07:21,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:07:21,735 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 10:07:21,735 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:07:21,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:07:21,744 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:07:21,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:07:21 BoogieIcfgContainer [2025-02-05 10:07:21,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:07:21,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:07:21,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:07:21,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:07:21,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:07:21" (1/3) ... [2025-02-05 10:07:21,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3262e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:07:21, skipping insertion in model container [2025-02-05 10:07:21,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:21" (2/3) ... [2025-02-05 10:07:21,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3262e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:07:21, skipping insertion in model container [2025-02-05 10:07:21,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:07:21" (3/3) ... [2025-02-05 10:07:21,753 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr2.c [2025-02-05 10:07:21,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:07:21,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr2.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:07:21,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:07:21,809 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;@32ac1c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:07:21,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:07:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:07:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:07:21,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:21,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:21,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:21,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 351630076, now seen corresponding path program 1 times [2025-02-05 10:07:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857472186] [2025-02-05 10:07:21,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:07:21,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:07:21,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:21,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857472186] [2025-02-05 10:07:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857472186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:07:21,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579215879] [2025-02-05 10:07:21,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:21,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:07:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:21,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:07:21,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:07:21,947 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:21,958 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2025-02-05 10:07:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:07:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-02-05 10:07:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:21,963 INFO L225 Difference]: With dead ends: 47 [2025-02-05 10:07:21,963 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 10:07:21,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:07:21,969 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:21,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 10:07:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-05 10:07:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:07:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 10:07:21,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2025-02-05 10:07:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:21,992 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 10:07:21,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 10:07:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:07:21,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:21,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:21,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:07:21,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 380259227, now seen corresponding path program 1 times [2025-02-05 10:07:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:21,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438432079] [2025-02-05 10:07:21,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:22,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:07:22,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:07:22,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:22,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438432079] [2025-02-05 10:07:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438432079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:07:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915076313] [2025-02-05 10:07:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:07:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:07:22,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:22,260 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:22,323 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-02-05 10:07:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:07:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-02-05 10:07:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:22,324 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:07:22,324 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 10:07:22,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:22,324 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:22,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 23 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 10:07:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2025-02-05 10:07:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:07:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-05 10:07:22,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2025-02-05 10:07:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:22,330 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-05 10:07:22,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-05 10:07:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:07:22,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:22,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:07:22,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 639774870, now seen corresponding path program 1 times [2025-02-05 10:07:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982643106] [2025-02-05 10:07:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:22,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:07:22,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:07:22,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:22,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982643106] [2025-02-05 10:07:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982643106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770514813] [2025-02-05 10:07:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:22,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:22,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:07:22,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:07:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:07:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:22,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:07:22,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-05 10:07:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:22,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:23,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-05 10:07:23,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-05 10:07:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770514813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:23,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:23,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2025-02-05 10:07:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328531062] [2025-02-05 10:07:23,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:07:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:23,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:07:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:07:23,059 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:07:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:23,219 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2025-02-05 10:07:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:07:23,219 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-02-05 10:07:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:23,220 INFO L225 Difference]: With dead ends: 59 [2025-02-05 10:07:23,220 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 10:07:23,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:07:23,221 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:23,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 133 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:07:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 10:07:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2025-02-05 10:07:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 10:07:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-02-05 10:07:23,230 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2025-02-05 10:07:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:23,230 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-05 10:07:23,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:07:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-02-05 10:07:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:07:23,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:23,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:23,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:23,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:23,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 768857589, now seen corresponding path program 1 times [2025-02-05 10:07:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:23,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914349236] [2025-02-05 10:07:23,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:23,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:23,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:07:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:07:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:23,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:23,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914349236] [2025-02-05 10:07:23,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914349236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:23,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202796097] [2025-02-05 10:07:23,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:23,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:23,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:23,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:07:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:07:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:07:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 10:07:23,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:23,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:07:23,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 10:07:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:23,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-05 10:07:24,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-05 10:07:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202796097] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:24,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2025-02-05 10:07:24,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271878716] [2025-02-05 10:07:24,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:07:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:24,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:07:24,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:07:24,045 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 10:07:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:24,417 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-02-05 10:07:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:07:24,418 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2025-02-05 10:07:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:24,419 INFO L225 Difference]: With dead ends: 80 [2025-02-05 10:07:24,419 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 10:07:24,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2025-02-05 10:07:24,420 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 168 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:24,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 223 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:07:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 10:07:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 25. [2025-02-05 10:07:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:07:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-05 10:07:24,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2025-02-05 10:07:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-05 10:07:24,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 10:07:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-05 10:07:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:07:24,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:24,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:24,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:07:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:24,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:24,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1530832681, now seen corresponding path program 1 times [2025-02-05 10:07:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:24,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919818713] [2025-02-05 10:07:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:24,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:07:24,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:07:24,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:24,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919818713] [2025-02-05 10:07:24,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919818713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:24,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337579282] [2025-02-05 10:07:24,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:24,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:24,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:07:24,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:07:24,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:07:24,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:24,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:24,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:07:24,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:24,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:25,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:25,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:25,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:07:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337579282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:25,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:25,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-02-05 10:07:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989292967] [2025-02-05 10:07:25,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:25,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:07:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:07:25,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:07:25,079 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:25,235 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-02-05 10:07:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:07:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2025-02-05 10:07:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:25,236 INFO L225 Difference]: With dead ends: 54 [2025-02-05 10:07:25,238 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 10:07:25,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:07:25,238 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:25,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 181 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:07:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 10:07:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2025-02-05 10:07:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 10:07:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-02-05 10:07:25,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2025-02-05 10:07:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:25,250 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-05 10:07:25,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-02-05 10:07:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:07:25,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:25,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:25,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:25,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 956680152, now seen corresponding path program 1 times [2025-02-05 10:07:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387928148] [2025-02-05 10:07:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:07:25,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:07:25,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:25,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:25,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387928148] [2025-02-05 10:07:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387928148] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790270247] [2025-02-05 10:07:25,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:25,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:25,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:25,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:25,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:07:25,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:07:25,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:07:25,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:25,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:07:25,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:25,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:25,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 10:07:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:25,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:25,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:25,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-05 10:07:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790270247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:26,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:26,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2025-02-05 10:07:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208911744] [2025-02-05 10:07:26,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:26,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 10:07:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:26,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 10:07:26,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:07:26,070 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:26,412 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2025-02-05 10:07:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:07:26,413 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2025-02-05 10:07:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:26,413 INFO L225 Difference]: With dead ends: 71 [2025-02-05 10:07:26,413 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 10:07:26,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:07:26,414 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:26,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 200 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:07:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 10:07:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 28. [2025-02-05 10:07:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 10:07:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-05 10:07:26,419 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2025-02-05 10:07:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-05 10:07:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-02-05 10:07:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 10:07:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:26,420 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:26,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:26,624 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,SelfDestructingSolverStorable5 [2025-02-05 10:07:26,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1072775946, now seen corresponding path program 2 times [2025-02-05 10:07:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089428457] [2025-02-05 10:07:26,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:07:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:26,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 10:07:26,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:07:26,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:07:26,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089428457] [2025-02-05 10:07:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089428457] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892481852] [2025-02-05 10:07:26,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:07:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:26,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:26,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:07:26,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 10:07:26,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:07:26,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:07:26,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:26,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:07:26,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:27,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:07:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892481852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:27,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2025-02-05 10:07:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157694172] [2025-02-05 10:07:27,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 10:07:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:27,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 10:07:27,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:07:27,309 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:27,459 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-02-05 10:07:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:07:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2025-02-05 10:07:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:27,460 INFO L225 Difference]: With dead ends: 56 [2025-02-05 10:07:27,460 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:07:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2025-02-05 10:07:27,461 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:27,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:07:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:07:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-02-05 10:07:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 10:07:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-02-05 10:07:27,470 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 30 [2025-02-05 10:07:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:27,471 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-05 10:07:27,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:07:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-02-05 10:07:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:07:27,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:27,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:27,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:07:27,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:27,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:27,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash 44390001, now seen corresponding path program 3 times [2025-02-05 10:07:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088488869] [2025-02-05 10:07:27,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:07:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:27,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-05 10:07:27,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 44 statements. [2025-02-05 10:07:27,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:07:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088488869] [2025-02-05 10:07:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088488869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775205534] [2025-02-05 10:07:27,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:07:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:27,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:27,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:07:27,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-05 10:07:27,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 44 statements. [2025-02-05 10:07:27,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:07:27,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:27,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 10:07:27,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:28,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:28,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-05 10:07:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:28,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:28,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:07:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775205534] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:28,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:28,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 21 [2025-02-05 10:07:28,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39076601] [2025-02-05 10:07:28,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:28,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:07:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:28,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:07:28,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:07:28,192 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-05 10:07:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:28,523 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2025-02-05 10:07:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 10:07:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 44 [2025-02-05 10:07:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:28,524 INFO L225 Difference]: With dead ends: 90 [2025-02-05 10:07:28,524 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 10:07:28,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:07:28,525 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 96 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:28,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 228 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:07:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 10:07:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2025-02-05 10:07:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 10:07:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2025-02-05 10:07:28,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 44 [2025-02-05 10:07:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-02-05 10:07:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 7 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-05 10:07:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2025-02-05 10:07:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:07:28,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:28,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:28,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:28,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 10:07:28,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:28,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash -952682352, now seen corresponding path program 1 times [2025-02-05 10:07:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703345127] [2025-02-05 10:07:28,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:28,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:07:28,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:07:28,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:28,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703345127] [2025-02-05 10:07:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703345127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563655690] [2025-02-05 10:07:28,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:28,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:28,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:28,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:07:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:07:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:07:29,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:29,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:29,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:07:29,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:29,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:29,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 10:07:29,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 10:07:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:07:29,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:29,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-05 10:07:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563655690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:29,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-02-05 10:07:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047270568] [2025-02-05 10:07:29,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 10:07:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:29,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 10:07:29,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-02-05 10:07:29,450 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:07:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:30,142 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2025-02-05 10:07:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 10:07:30,142 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 44 [2025-02-05 10:07:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:30,143 INFO L225 Difference]: With dead ends: 133 [2025-02-05 10:07:30,143 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 10:07:30,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=447, Invalid=2003, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 10:07:30,145 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 286 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:30,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 340 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:07:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 10:07:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 51. [2025-02-05 10:07:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 10:07:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-02-05 10:07:30,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 44 [2025-02-05 10:07:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:30,153 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-02-05 10:07:30,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:07:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-02-05 10:07:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:07:30,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:30,154 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:30,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:07:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:30,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash -426532580, now seen corresponding path program 4 times [2025-02-05 10:07:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221835427] [2025-02-05 10:07:30,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:07:30,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:30,361 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-05 10:07:30,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-02-05 10:07:30,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:07:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221835427] [2025-02-05 10:07:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221835427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47964757] [2025-02-05 10:07:30,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:07:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:30,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:30,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:07:30,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-05 10:07:30,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-02-05 10:07:30,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:07:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:30,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:07:30,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:30,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-05 10:07:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:30,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:30,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:07:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47964757] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:30,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2025-02-05 10:07:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589315808] [2025-02-05 10:07:30,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:07:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:30,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:07:30,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:07:30,692 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:07:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:31,023 INFO L93 Difference]: Finished difference Result 150 states and 208 transitions. [2025-02-05 10:07:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:07:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-02-05 10:07:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:31,024 INFO L225 Difference]: With dead ends: 150 [2025-02-05 10:07:31,024 INFO L226 Difference]: Without dead ends: 148 [2025-02-05 10:07:31,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:07:31,025 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 51 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:31,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 276 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:07:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-05 10:07:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2025-02-05 10:07:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 10:07:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-02-05 10:07:31,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 47 [2025-02-05 10:07:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-02-05 10:07:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:07:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-02-05 10:07:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:07:31,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:31,067 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:31,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:31,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:31,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1081019229, now seen corresponding path program 1 times [2025-02-05 10:07:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886380649] [2025-02-05 10:07:31,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:07:31,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:07:31,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:31,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886380649] [2025-02-05 10:07:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886380649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167663030] [2025-02-05 10:07:31,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:31,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:31,624 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:07:31,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:07:31,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:07:31,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:31,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 10:07:31,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:31,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 10:07:31,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 10:07:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:31,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:32,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 10:07:32,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-05 10:07:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167663030] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:32,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2025-02-05 10:07:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120157550] [2025-02-05 10:07:32,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:07:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:32,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:07:32,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:07:32,254 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 32 states, 32 states have (on average 2.75) internal successors, (88), 32 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 10:07:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:33,458 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2025-02-05 10:07:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 10:07:33,461 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 32 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2025-02-05 10:07:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:33,462 INFO L225 Difference]: With dead ends: 270 [2025-02-05 10:07:33,462 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 10:07:33,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=664, Invalid=3368, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 10:07:33,463 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 306 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:33,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 513 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:07:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 10:07:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 54. [2025-02-05 10:07:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 10:07:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-02-05 10:07:33,483 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 47 [2025-02-05 10:07:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:33,484 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-02-05 10:07:33,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 32 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 10:07:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-02-05 10:07:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:07:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:33,485 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:33,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:33,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:33,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:33,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1977012881, now seen corresponding path program 5 times [2025-02-05 10:07:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132726329] [2025-02-05 10:07:33,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:07:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:33,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-02-05 10:07:33,707 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:07:33,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 10:07:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132726329] [2025-02-05 10:07:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132726329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209096229] [2025-02-05 10:07:33,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:07:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:33,865 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:33,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:07:33,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-02-05 10:07:33,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:07:33,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 10:07:33,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:33,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:07:33,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:34,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:07:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209096229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:34,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-02-05 10:07:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688414005] [2025-02-05 10:07:34,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:34,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 10:07:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:34,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 10:07:34,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:07:34,388 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 10:07:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:34,613 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-02-05 10:07:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:07:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2025-02-05 10:07:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:34,614 INFO L225 Difference]: With dead ends: 98 [2025-02-05 10:07:34,614 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 10:07:34,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 10:07:34,614 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 146 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:34,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 105 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:07:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 10:07:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2025-02-05 10:07:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 10:07:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-02-05 10:07:34,625 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2025-02-05 10:07:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:34,625 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-02-05 10:07:34,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 10:07:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-02-05 10:07:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 10:07:34,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:34,626 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:34,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:07:34,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 10:07:34,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash 161800332, now seen corresponding path program 6 times [2025-02-05 10:07:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618434335] [2025-02-05 10:07:34,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:07:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:34,838 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 6 equivalence classes. [2025-02-05 10:07:34,850 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 10:07:34,850 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-05 10:07:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 10:07:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618434335] [2025-02-05 10:07:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618434335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199756706] [2025-02-05 10:07:35,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:07:35,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:35,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:35,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:07:35,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:07:35,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 6 equivalence classes. [2025-02-05 10:07:35,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 10:07:35,158 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-05 10:07:35,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:35,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-05 10:07:35,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:35,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-05 10:07:47,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-05 10:07:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:07:47,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:55,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-05 10:07:55,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-05 10:07:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 10:07:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199756706] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:55,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:55,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 30 [2025-02-05 10:07:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506993825] [2025-02-05 10:07:55,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:55,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 10:07:55,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:55,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 10:07:55,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=741, Unknown=5, NotChecked=0, Total=870 [2025-02-05 10:07:55,715 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2025-02-05 10:07:59,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:03,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:07,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:15,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:19,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:23,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:31,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:35,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:39,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:48,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:08:52,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:09:00,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:09:04,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]