./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_pattern.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-patterns/array23_pattern.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 e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:22:19,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:22:19,080 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:22:19,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:22:19,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:22:19,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:22:19,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:22:19,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:22:19,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:22:19,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:22:19,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:22:19,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:22:19,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:22:19,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:22:19,111 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:22:19,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:22:19,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:22:19,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:22:19,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:22:19,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:22:19,113 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2025-02-05 10:22:19,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:22:19,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:22:19,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:22:19,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:22:19,345 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:22:19,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2025-02-05 10:22:20,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23338b61a/f4a9c56e686f4448b2be98fd6c70511a/FLAG27e373cdb [2025-02-05 10:22:20,669 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:22:20,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2025-02-05 10:22:20,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23338b61a/f4a9c56e686f4448b2be98fd6c70511a/FLAG27e373cdb [2025-02-05 10:22:20,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23338b61a/f4a9c56e686f4448b2be98fd6c70511a [2025-02-05 10:22:21,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:22:21,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:22:21,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:22:21,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:22:21,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:22:21,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:22:20" (1/1) ... [2025-02-05 10:22:21,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23309820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21, skipping insertion in model container [2025-02-05 10:22:21,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:22:20" (1/1) ... [2025-02-05 10:22:21,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:22:21,113 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-patterns/array23_pattern.c[1347,1360] [2025-02-05 10:22:21,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:22:21,147 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:22:21,155 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-patterns/array23_pattern.c[1347,1360] [2025-02-05 10:22:21,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:22:21,177 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:22:21,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21 WrapperNode [2025-02-05 10:22:21,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:22:21,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:22:21,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:22:21,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:22:21,182 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:22:21" (1/1) ... [2025-02-05 10:22:21,187 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:22:21" (1/1) ... [2025-02-05 10:22:21,199 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-02-05 10:22:21,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:22:21,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:22:21,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:22:21,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:22:21,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,215 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-05 10:22:21,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:22:21,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:22:21,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:22:21,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:22:21,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (1/1) ... [2025-02-05 10:22:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:22:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:21,267 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:22:21,271 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:22:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-02-05 10:22:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-02-05 10:22:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:22:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 10:22:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 10:22:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:22:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:22:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:22:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:22:21,333 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:22:21,334 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:22:21,463 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-05 10:22:21,488 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 10:22:21,488 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:22:21,494 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:22:21,494 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:22:21,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:22:21 BoogieIcfgContainer [2025-02-05 10:22:21,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:22:21,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:22:21,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:22:21,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:22:21,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:22:20" (1/3) ... [2025-02-05 10:22:21,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7740a1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:22:21, skipping insertion in model container [2025-02-05 10:22:21,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:21" (2/3) ... [2025-02-05 10:22:21,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7740a1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:22:21, skipping insertion in model container [2025-02-05 10:22:21,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:22:21" (3/3) ... [2025-02-05 10:22:21,502 INFO L128 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2025-02-05 10:22:21,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:22:21,516 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array23_pattern.c that has 3 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-05 10:22:21,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:22:21,564 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;@69371c72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:22:21,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:22:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:22:21,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:21,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:21,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:21,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1959484098, now seen corresponding path program 1 times [2025-02-05 10:22:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92248091] [2025-02-05 10:22:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:21,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:22:21,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:22:21,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:21,696 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:22:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92248091] [2025-02-05 10:22:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92248091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:22:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857127405] [2025-02-05 10:22:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:21,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:22:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:21,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:22:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:22:21,718 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 10:22:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:21,734 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-02-05 10:22:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:22:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-05 10:22:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:21,740 INFO L225 Difference]: With dead ends: 69 [2025-02-05 10:22:21,740 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:22:21,742 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:22:21,748 INFO L435 NwaCegarLoop]: 46 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, 46 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:22:21,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:22:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 10:22:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-05 10:22:21,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-02-05 10:22:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:21,783 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-05 10:22:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 10:22:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-02-05 10:22:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 10:22:21,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:21,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:21,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:22:21,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:21,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -634911244, now seen corresponding path program 1 times [2025-02-05 10:22:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:21,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842669851] [2025-02-05 10:22:21,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:21,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 10:22:21,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 10:22:21,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:22:22,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:22,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842669851] [2025-02-05 10:22:22,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842669851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:22,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:22,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:22,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177229677] [2025-02-05 10:22:22,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:22,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:22,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:22,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:22,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:22,061 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:22,090 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-02-05 10:22:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:22,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-02-05 10:22:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:22,091 INFO L225 Difference]: With dead ends: 37 [2025-02-05 10:22:22,091 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 10:22:22,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:22,092 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:22,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 10:22:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 10:22:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-05 10:22:22,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-02-05 10:22:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:22,100 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-05 10:22:22,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-05 10:22:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:22:22,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:22,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:22:22,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash 484814132, now seen corresponding path program 1 times [2025-02-05 10:22:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469773178] [2025-02-05 10:22:22,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:22:22,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:22:22,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:22,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 10:22:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469773178] [2025-02-05 10:22:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469773178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:22,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:22,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:22:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99094303] [2025-02-05 10:22:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:22,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:22:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:22,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:22:22,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:22:22,264 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:22,354 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-02-05 10:22:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:22:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-02-05 10:22:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:22,355 INFO L225 Difference]: With dead ends: 68 [2025-02-05 10:22:22,355 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 10:22:22,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:22:22,356 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:22,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 10:22:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-05 10:22:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-02-05 10:22:22,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-02-05 10:22:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:22,368 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-02-05 10:22:22,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-02-05 10:22:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 10:22:22,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:22,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:22,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:22:22,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:22,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1011701486, now seen corresponding path program 1 times [2025-02-05 10:22:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613928456] [2025-02-05 10:22:22,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:22,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 10:22:22,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 10:22:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:22,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:22:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613928456] [2025-02-05 10:22:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613928456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796934776] [2025-02-05 10:22:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:22,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:22,474 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:22,534 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-02-05 10:22:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-02-05 10:22:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:22,535 INFO L225 Difference]: With dead ends: 68 [2025-02-05 10:22:22,535 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:22:22,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:22,536 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:22,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:22:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 10:22:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-02-05 10:22:22,544 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-02-05 10:22:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:22,545 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-02-05 10:22:22,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-02-05 10:22:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:22:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:22,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:22:22,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:22,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 808191946, now seen corresponding path program 1 times [2025-02-05 10:22:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89324919] [2025-02-05 10:22:22,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:22:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:22:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89324919] [2025-02-05 10:22:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89324919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792139525] [2025-02-05 10:22:22,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:22,746 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:22:22,748 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:22:22,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:22:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:22:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:22,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:22,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:22:22,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792139525] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:22,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-05 10:22:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607552110] [2025-02-05 10:22:22,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:22:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:22,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:22:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:22:22,997 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 10:22:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:23,120 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-02-05 10:22:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:22:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 47 [2025-02-05 10:22:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:23,122 INFO L225 Difference]: With dead ends: 74 [2025-02-05 10:22:23,122 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:22:23,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:22:23,123 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:23,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:22:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-05 10:22:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-02-05 10:22:23,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-02-05 10:22:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:23,135 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-02-05 10:22:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 10:22:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-02-05 10:22:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:22:23,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:23,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:23,142 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:22:23,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:23,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:23,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 151000504, now seen corresponding path program 2 times [2025-02-05 10:22:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:23,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162432300] [2025-02-05 10:22:23,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:23,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 10:22:23,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:22:23,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 10:22:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162432300] [2025-02-05 10:22:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162432300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547567707] [2025-02-05 10:22:23,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:23,477 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:22:23,492 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:22:23,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 10:22:23,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:22:23,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:23,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:22:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:23,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:22:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547567707] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:23,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:23,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-05 10:22:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453475418] [2025-02-05 10:22:23,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:22:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:23,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:22:23,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:22:23,677 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 10:22:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:23,852 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-02-05 10:22:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:22:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 49 [2025-02-05 10:22:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:23,853 INFO L225 Difference]: With dead ends: 85 [2025-02-05 10:22:23,853 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 10:22:23,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:22:23,854 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:23,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 10:22:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-02-05 10:22:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 10:22:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-02-05 10:22:23,863 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-02-05 10:22:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-02-05 10:22:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 10:22:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-02-05 10:22:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:23,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:23,866 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:23,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:24,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:24,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2019860860, now seen corresponding path program 3 times [2025-02-05 10:22:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266362256] [2025-02-05 10:22:24,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:22:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:24,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-02-05 10:22:24,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:24,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 10:22:24,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:22:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342702080] [2025-02-05 10:22:24,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:22:24,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:24,137 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:22:24,139 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:22:24,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-02-05 10:22:24,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:24,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 10:22:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:24,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-05 10:22:24,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:24,884 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 11 treesize of output 7 [2025-02-05 10:22:24,927 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 19 treesize of output 18 [2025-02-05 10:22:25,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:25,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:22:25,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:25,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-05 10:22:26,129 INFO L349 Elim1Store]: treesize reduction 208, result has 33.5 percent of original size [2025-02-05 10:22:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 74 treesize of output 142 [2025-02-05 10:22:26,869 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 148 treesize of output 126 [2025-02-05 10:22:26,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:26,909 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-05 10:22:26,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 126 treesize of output 223 [2025-02-05 10:22:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:27,087 INFO L349 Elim1Store]: treesize reduction 144, result has 37.1 percent of original size [2025-02-05 10:22:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 171 [2025-02-05 10:22:28,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:28,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 69 [2025-02-05 10:22:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:22:28,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:35,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266362256] [2025-02-05 10:22:35,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:22:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342702080] [2025-02-05 10:22:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342702080] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:35,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2025-02-05 10:22:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161177866] [2025-02-05 10:22:35,197 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:35,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 10:22:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:35,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 10:22:35,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2424, Unknown=1, NotChecked=0, Total=2756 [2025-02-05 10:22:35,200 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:22:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:36,571 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2025-02-05 10:22:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 10:22:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-02-05 10:22:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:36,573 INFO L225 Difference]: With dead ends: 142 [2025-02-05 10:22:36,573 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 10:22:36,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=388, Invalid=2917, Unknown=1, NotChecked=0, Total=3306 [2025-02-05 10:22:36,574 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:36,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 437 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 10:22:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 10:22:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2025-02-05 10:22:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-05 10:22:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-02-05 10:22:36,592 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 57 [2025-02-05 10:22:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:36,593 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-02-05 10:22:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:22:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-02-05 10:22:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:36,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:36,594 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:36,599 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:22:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:36,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:36,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash -767554627, now seen corresponding path program 1 times [2025-02-05 10:22:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:36,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167392925] [2025-02-05 10:22:36,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:36,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:36,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:36,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:36,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167392925] [2025-02-05 10:22:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167392925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:36,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651107141] [2025-02-05 10:22:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:36,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:36,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:36,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:36,872 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:22:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:36,894 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2025-02-05 10:22:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-02-05 10:22:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:36,898 INFO L225 Difference]: With dead ends: 130 [2025-02-05 10:22:36,898 INFO L226 Difference]: Without dead ends: 97 [2025-02-05 10:22:36,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:36,898 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:36,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-05 10:22:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-05 10:22:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2025-02-05 10:22:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-02-05 10:22:36,919 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 57 [2025-02-05 10:22:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:36,920 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-02-05 10:22:36,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:22:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-02-05 10:22:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:36,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:36,921 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:36,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:22:36,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:36,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1612026498, now seen corresponding path program 1 times [2025-02-05 10:22:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:36,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184794543] [2025-02-05 10:22:36,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:36,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:36,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:36,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:36,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184794543] [2025-02-05 10:22:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184794543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382824214] [2025-02-05 10:22:37,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:37,085 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:22:37,086 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:22:37,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:37,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:37,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:37,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:37,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 10:22:37,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 10:22:37,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 10:22:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382824214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:37,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 15 [2025-02-05 10:22:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991676557] [2025-02-05 10:22:37,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:22:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:37,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:22:37,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:22:37,445 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:22:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:37,700 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-02-05 10:22:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:22:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-02-05 10:22:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:37,702 INFO L225 Difference]: With dead ends: 151 [2025-02-05 10:22:37,702 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 10:22:37,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:22:37,703 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:37,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 195 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:22:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 10:22:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-05 10:22:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 10:22:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2025-02-05 10:22:37,718 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 57 [2025-02-05 10:22:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2025-02-05 10:22:37,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:22:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2025-02-05 10:22:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:37,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:37,719 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:37,726 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:22:37,919 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,SelfDestructingSolverStorable8 [2025-02-05 10:22:37,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1030341955, now seen corresponding path program 1 times [2025-02-05 10:22:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199050663] [2025-02-05 10:22:37,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:37,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:37,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:37,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199050663] [2025-02-05 10:22:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199050663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620408911] [2025-02-05 10:22:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:37,984 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:22:37,986 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:22:38,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:38,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:22:38,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 10:22:38,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:22:38,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620408911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:38,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:38,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:22:38,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844964003] [2025-02-05 10:22:38,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:38,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:38,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:38,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:38,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:22:38,060 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:38,080 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2025-02-05 10:22:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-02-05 10:22:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:38,082 INFO L225 Difference]: With dead ends: 142 [2025-02-05 10:22:38,082 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 10:22:38,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:22:38,084 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 10:22:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 10:22:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 10:22:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-02-05 10:22:38,101 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 57 [2025-02-05 10:22:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:38,101 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-02-05 10:22:38,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-02-05 10:22:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:38,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:38,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:38,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:38,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 10:22:38,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:38,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1313492419, now seen corresponding path program 1 times [2025-02-05 10:22:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607154159] [2025-02-05 10:22:38,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:38,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:38,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:38,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:38,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607154159] [2025-02-05 10:22:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607154159] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733973670] [2025-02-05 10:22:38,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:38,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:38,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:38,358 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:22:38,360 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:22:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:38,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:22:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 10:22:38,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:22:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733973670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:38,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-05 10:22:38,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757966802] [2025-02-05 10:22:38,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:38,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:38,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:38,433 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:38,451 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2025-02-05 10:22:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-02-05 10:22:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:38,453 INFO L225 Difference]: With dead ends: 142 [2025-02-05 10:22:38,453 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 10:22:38,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:38,454 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:38,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 10:22:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 10:22:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 10:22:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2025-02-05 10:22:38,466 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 57 [2025-02-05 10:22:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:38,466 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2025-02-05 10:22:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 10:22:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2025-02-05 10:22:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:38,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:38,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:38,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:22:38,680 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,SelfDestructingSolverStorable10 [2025-02-05 10:22:38,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:38,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -68727938, now seen corresponding path program 1 times [2025-02-05 10:22:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176338802] [2025-02-05 10:22:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:38,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 10:22:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176338802] [2025-02-05 10:22:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176338802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892731091] [2025-02-05 10:22:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:38,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:38,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:38,982 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:22:38,986 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:22:39,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:39,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:22:39,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 10:22:39,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 10:22:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892731091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-02-05 10:22:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564626276] [2025-02-05 10:22:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:39,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:22:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:39,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:22:39,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:22:39,333 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 10:22:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:39,631 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2025-02-05 10:22:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:22:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 57 [2025-02-05 10:22:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:39,632 INFO L225 Difference]: With dead ends: 200 [2025-02-05 10:22:39,632 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 10:22:39,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:22:39,633 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:39,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 263 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:22:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 10:22:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2025-02-05 10:22:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.170731707317073) internal successors, (96), 81 states have internal predecessors, (96), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 10:22:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2025-02-05 10:22:39,646 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 57 [2025-02-05 10:22:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:39,646 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2025-02-05 10:22:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 20 states have internal predecessors, (60), 6 states have call successors, (13), 2 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 10:22:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2025-02-05 10:22:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:39,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:39,647 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:39,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:39,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:39,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:39,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -913199809, now seen corresponding path program 1 times [2025-02-05 10:22:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527104085] [2025-02-05 10:22:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:39,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:39,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:39,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:39,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527104085] [2025-02-05 10:22:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527104085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851760790] [2025-02-05 10:22:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:39,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:39,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:39,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:39,889 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:22:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:39,911 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2025-02-05 10:22:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:39,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-02-05 10:22:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:39,913 INFO L225 Difference]: With dead ends: 146 [2025-02-05 10:22:39,913 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 10:22:39,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:39,914 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:39,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 10:22:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-05 10:22:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 81 states have internal predecessors, (95), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 10:22:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-02-05 10:22:39,927 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 57 [2025-02-05 10:22:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:39,928 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-02-05 10:22:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:22:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-02-05 10:22:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:39,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:39,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:22:39,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash 594352000, now seen corresponding path program 1 times [2025-02-05 10:22:39,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:39,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692016820] [2025-02-05 10:22:39,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:39,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:39,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:39,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:22:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692016820] [2025-02-05 10:22:40,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692016820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289357107] [2025-02-05 10:22:40,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:40,124 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:22:40,125 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:22:40,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:40,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:40,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:40,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 10:22:40,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 10:22:40,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:22:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289357107] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:40,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 22 [2025-02-05 10:22:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748503678] [2025-02-05 10:22:40,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 10:22:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:40,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 10:22:40,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:22:40,568 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 10:22:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:40,854 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2025-02-05 10:22:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 10:22:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 57 [2025-02-05 10:22:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:40,856 INFO L225 Difference]: With dead ends: 206 [2025-02-05 10:22:40,856 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 10:22:40,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:22:40,857 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:40,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:22:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 10:22:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2025-02-05 10:22:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.161904761904762) internal successors, (122), 104 states have internal predecessors, (122), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-05 10:22:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2025-02-05 10:22:40,870 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 57 [2025-02-05 10:22:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:40,870 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2025-02-05 10:22:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 10:22:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2025-02-05 10:22:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:22:40,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:40,871 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:40,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:22:41,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:41,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1807867506, now seen corresponding path program 4 times [2025-02-05 10:22:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745407220] [2025-02-05 10:22:41,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:22:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:41,080 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-05 10:22:41,085 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-02-05 10:22:41,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:22:41,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 10:22:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745407220] [2025-02-05 10:22:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745407220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013494974] [2025-02-05 10:22:41,164 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:22:41,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:41,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:41,166 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:22:41,167 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:22:41,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-05 10:22:41,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-02-05 10:22:41,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:22:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:41,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:22:41,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 10:22:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013494974] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:41,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:22:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164680023] [2025-02-05 10:22:41,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:22:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:41,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:22:41,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:22:41,397 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:41,513 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2025-02-05 10:22:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:22:41,513 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-02-05 10:22:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:41,514 INFO L225 Difference]: With dead ends: 218 [2025-02-05 10:22:41,514 INFO L226 Difference]: Without dead ends: 139 [2025-02-05 10:22:41,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:22:41,515 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:41,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-05 10:22:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-02-05 10:22:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 109 states have internal predecessors, (126), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-05 10:22:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-02-05 10:22:41,528 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 58 [2025-02-05 10:22:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:41,528 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-02-05 10:22:41,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-02-05 10:22:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:22:41,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:41,529 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:41,535 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:22:41,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:41,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:41,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2025021380, now seen corresponding path program 5 times [2025-02-05 10:22:41,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:41,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523631686] [2025-02-05 10:22:41,730 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:22:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:41,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-02-05 10:22:41,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-02-05 10:22:41,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-05 10:22:41,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:22:41,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:41,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523631686] [2025-02-05 10:22:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523631686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:41,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992385006] [2025-02-05 10:22:41,801 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:22:41,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:41,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:41,803 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:22:41,805 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:22:41,846 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-02-05 10:22:41,854 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 58 statements. [2025-02-05 10:22:41,854 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-05 10:22:41,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:41,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:41,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 10:22:41,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:22:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992385006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:41,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-05 10:22:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638362144] [2025-02-05 10:22:41,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:41,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:22:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:41,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:22:41,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:22:41,952 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:42,070 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2025-02-05 10:22:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:22:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-02-05 10:22:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:42,072 INFO L225 Difference]: With dead ends: 172 [2025-02-05 10:22:42,072 INFO L226 Difference]: Without dead ends: 128 [2025-02-05 10:22:42,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:22:42,072 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:42,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 230 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-05 10:22:42,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-02-05 10:22:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.108910891089109) internal successors, (112), 99 states have internal predecessors, (112), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-05 10:22:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2025-02-05 10:22:42,085 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 58 [2025-02-05 10:22:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:42,085 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2025-02-05 10:22:42,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2025-02-05 10:22:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 10:22:42,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:42,087 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:42,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:42,287 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,SelfDestructingSolverStorable15 [2025-02-05 10:22:42,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:42,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 416378932, now seen corresponding path program 6 times [2025-02-05 10:22:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782665014] [2025-02-05 10:22:42,288 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:22:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:42,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-02-05 10:22:42,327 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:22:42,327 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-05 10:22:42,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 10:22:42,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:42,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782665014] [2025-02-05 10:22:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782665014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69859170] [2025-02-05 10:22:42,431 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:22:42,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:42,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:42,433 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:22:42,434 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:22:42,478 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-02-05 10:22:42,850 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 10:22:42,851 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-05 10:22:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:42,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:42,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:22:42,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 10:22:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69859170] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:43,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:43,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:22:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64527664] [2025-02-05 10:22:43,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:43,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:22:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:43,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:22:43,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:22:43,058 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:43,283 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2025-02-05 10:22:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 10:22:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-02-05 10:22:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:43,284 INFO L225 Difference]: With dead ends: 140 [2025-02-05 10:22:43,284 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 10:22:43,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-02-05 10:22:43,285 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:43,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 260 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 10:22:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-02-05 10:22:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 104 states have internal predecessors, (118), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-05 10:22:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2025-02-05 10:22:43,297 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 61 [2025-02-05 10:22:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2025-02-05 10:22:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2025-02-05 10:22:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 10:22:43,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:43,298 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:43,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:22:43,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 10:22:43,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:43,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1306566452, now seen corresponding path program 7 times [2025-02-05 10:22:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:43,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951729214] [2025-02-05 10:22:43,500 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:22:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:43,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:22:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:22:43,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 10:22:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951729214] [2025-02-05 10:22:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951729214] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714014584] [2025-02-05 10:22:43,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:22:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:43,609 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:43,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:22:43,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:22:43,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:22:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:43,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:43,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 10:22:43,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 10:22:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714014584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:43,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 10:22:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784929398] [2025-02-05 10:22:43,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:22:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:43,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:22:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:22:43,837 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:43,989 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2025-02-05 10:22:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:22:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-02-05 10:22:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:43,990 INFO L225 Difference]: With dead ends: 195 [2025-02-05 10:22:43,990 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 10:22:43,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:22:43,991 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:43,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 10:22:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-02-05 10:22:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.117117117117117) internal successors, (124), 109 states have internal predecessors, (124), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-05 10:22:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2025-02-05 10:22:44,003 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 66 [2025-02-05 10:22:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2025-02-05 10:22:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:22:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2025-02-05 10:22:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 10:22:44,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:44,004 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:44,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:22:44,209 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -787902902, now seen corresponding path program 8 times [2025-02-05 10:22:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66368346] [2025-02-05 10:22:44,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:44,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-05 10:22:44,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 10:22:44,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:44,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:22:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581100730] [2025-02-05 10:22:44,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:44,249 INFO L229 MonitoredProcess]: Starting monitored process 14 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:22:44,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:22:44,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-05 10:22:44,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 10:22:44,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:44,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:44,863 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-02-05 10:22:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:44,915 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 11 treesize of output 7 [2025-02-05 10:22:44,949 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 19 treesize of output 18 [2025-02-05 10:22:44,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:44,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:22:45,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-02-05 10:22:45,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-02-05 10:22:45,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-05 10:22:45,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-05 10:22:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 77 treesize of output 94 [2025-02-05 10:22:45,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:45,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:45,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 88 treesize of output 108 [2025-02-05 10:22:46,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:46,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:46,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:47,271 INFO L349 Elim1Store]: treesize reduction 386, result has 32.6 percent of original size [2025-02-05 10:22:47,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 39 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 165 case distinctions, treesize of input 186 treesize of output 318 [2025-02-05 10:22:55,625 INFO L349 Elim1Store]: treesize reduction 320, result has 30.0 percent of original size [2025-02-05 10:22:55,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 1020 treesize of output 976 [2025-02-05 10:23:18,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,704 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:18,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:18,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:19,890 INFO L349 Elim1Store]: treesize reduction 691, result has 7.5 percent of original size [2025-02-05 10:23:19,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 16 select indices, 16 select index equivalence classes, 49 disjoint index pairs (out of 120 index pairs), introduced 15 new quantified variables, introduced 51 case distinctions, treesize of input 1016 treesize of output 1103 [2025-02-05 10:23:33,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,851 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:33,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:33,969 INFO L349 Elim1Store]: treesize reduction 143, result has 40.9 percent of original size [2025-02-05 10:23:33,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 147