./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 77ae88daffb8285870a38f38e30db5571fe2930110ef63da660dc306a4cb95e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:04:53,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:04:53,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:04:53,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:04:53,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:04:53,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:04:53,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:04:53,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:04:53,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:04:53,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:04:53,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:04:53,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:04:53,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:04:53,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:04:53,642 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:04:53,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:04:53,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:04:53,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:04:53,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:04:53,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:04:53,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:04:53,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:04:53,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:04:53,644 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77ae88daffb8285870a38f38e30db5571fe2930110ef63da660dc306a4cb95e3 [2025-02-05 18:04:53,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:04:53,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:04:53,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:04:53,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:04:53,923 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:04:53,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-02-05 18:04:55,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552f7e3af/311f0e5bd37d4f11a6ab8461589bf518/FLAG9aa1644b9 [2025-02-05 18:04:55,612 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:04:55,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-02-05 18:04:55,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552f7e3af/311f0e5bd37d4f11a6ab8461589bf518/FLAG9aa1644b9 [2025-02-05 18:04:55,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552f7e3af/311f0e5bd37d4f11a6ab8461589bf518 [2025-02-05 18:04:55,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:04:55,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:04:55,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:04:55,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:04:55,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:04:55,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:04:55" (1/1) ... [2025-02-05 18:04:55,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:55, skipping insertion in model container [2025-02-05 18:04:55,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:04:55" (1/1) ... [2025-02-05 18:04:55,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:04:55,869 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/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2025-02-05 18:04:56,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:04:56,158 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:04:56,169 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/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2025-02-05 18:04:56,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:04:56,310 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:04:56,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56 WrapperNode [2025-02-05 18:04:56,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:04:56,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:04:56,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:04:56,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:04:56,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,616 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2352 [2025-02-05 18:04:56,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:04:56,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:04:56,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:04:56,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:04:56,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,793 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2025-02-05 18:04:56,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:56,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:57,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:04:57,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:04:57,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:04:57,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:04:57,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (1/1) ... [2025-02-05 18:04:57,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:04:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:04:57,048 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 18:04:57,052 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 18:04:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:04:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 18:04:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 18:04:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:04:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:04:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 18:04:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 18:04:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 18:04:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 18:04:57,355 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:04:57,357 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:04:59,784 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#state_14~0#1.base, main_~#state_14~0#1.offset);havoc main_~#state_14~0#1.base, main_~#state_14~0#1.offset;call ULTIMATE.dealloc(main_~#state_44~0#1.base, main_~#state_44~0#1.offset);havoc main_~#state_44~0#1.base, main_~#state_44~0#1.offset; [2025-02-05 18:05:00,288 INFO L? ?]: Removed 1271 outVars from TransFormulas that were not future-live. [2025-02-05 18:05:00,289 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:05:00,428 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:05:00,428 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:05:00,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:00 BoogieIcfgContainer [2025-02-05 18:05:00,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:05:00,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:05:00,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:05:00,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:05:00,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:04:55" (1/3) ... [2025-02-05 18:05:00,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ad23c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:00, skipping insertion in model container [2025-02-05 18:05:00,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:04:56" (2/3) ... [2025-02-05 18:05:00,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ad23c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:00, skipping insertion in model container [2025-02-05 18:05:00,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:00" (3/3) ... [2025-02-05 18:05:00,442 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2025-02-05 18:05:00,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:05:00,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c that has 2 procedures, 740 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-05 18:05:00,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:05:00,554 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;@1e56e790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:05:00,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:05:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 740 states, 732 states have (on average 1.4972677595628416) internal successors, (1096), 733 states have internal predecessors, (1096), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 18:05:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 18:05:00,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:00,583 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:00,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:00,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1447074649, now seen corresponding path program 1 times [2025-02-05 18:05:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123973523] [2025-02-05 18:05:00,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:00,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 18:05:00,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 18:05:00,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:00,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 18:05:01,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123973523] [2025-02-05 18:05:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123973523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703764195] [2025-02-05 18:05:01,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:01,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:01,178 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 18:05:01,180 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 18:05:01,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 18:05:01,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 18:05:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:01,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 18:05:01,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 18:05:01,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:05:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703764195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:01,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:05:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 18:05:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218608943] [2025-02-05 18:05:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 18:05:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:01,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 18:05:01,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 18:05:01,760 INFO L87 Difference]: Start difference. First operand has 740 states, 732 states have (on average 1.4972677595628416) internal successors, (1096), 733 states have internal predecessors, (1096), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 18:05:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:02,103 INFO L93 Difference]: Finished difference Result 1385 states and 2077 transitions. [2025-02-05 18:05:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 18:05:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 235 [2025-02-05 18:05:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:02,123 INFO L225 Difference]: With dead ends: 1385 [2025-02-05 18:05:02,123 INFO L226 Difference]: Without dead ends: 737 [2025-02-05 18:05:02,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 236 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 18:05:02,131 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:02,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 923 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-02-05 18:05:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2025-02-05 18:05:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 730 states have (on average 1.4945205479452055) internal successors, (1091), 730 states have internal predecessors, (1091), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 18:05:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1101 transitions. [2025-02-05 18:05:02,220 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1101 transitions. Word has length 235 [2025-02-05 18:05:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:02,222 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1101 transitions. [2025-02-05 18:05:02,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 18:05:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1101 transitions. [2025-02-05 18:05:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 18:05:02,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:02,234 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:02,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 18:05:02,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 18:05:02,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:02,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -451077118, now seen corresponding path program 1 times [2025-02-05 18:05:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566480932] [2025-02-05 18:05:02,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:02,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 18:05:02,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 18:05:02,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:02,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566480932] [2025-02-05 18:05:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566480932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799872439] [2025-02-05 18:05:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:03,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:03,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:03,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:03,230 INFO L87 Difference]: Start difference. First operand 737 states and 1101 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:03,608 INFO L93 Difference]: Finished difference Result 1472 states and 2200 transitions. [2025-02-05 18:05:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 235 [2025-02-05 18:05:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:03,615 INFO L225 Difference]: With dead ends: 1472 [2025-02-05 18:05:03,615 INFO L226 Difference]: Without dead ends: 742 [2025-02-05 18:05:03,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:03,622 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:03,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1840 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-05 18:05:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 738. [2025-02-05 18:05:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 731 states have (on average 1.493844049247606) internal successors, (1092), 731 states have internal predecessors, (1092), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 18:05:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1102 transitions. [2025-02-05 18:05:03,663 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1102 transitions. Word has length 235 [2025-02-05 18:05:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:03,663 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1102 transitions. [2025-02-05 18:05:03,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1102 transitions. [2025-02-05 18:05:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 18:05:03,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:03,669 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:05:03,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1080919590, now seen corresponding path program 1 times [2025-02-05 18:05:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232580078] [2025-02-05 18:05:03,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:03,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 18:05:03,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 18:05:03,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:03,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232580078] [2025-02-05 18:05:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232580078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358825124] [2025-02-05 18:05:04,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:04,229 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 18:05:04,231 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 18:05:04,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 18:05:04,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 18:05:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:04,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 18:05:04,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:04,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 18:05:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358825124] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:04,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:05:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-02-05 18:05:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473805652] [2025-02-05 18:05:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:04,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:04,892 INFO L87 Difference]: Start difference. First operand 738 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:05,226 INFO L93 Difference]: Finished difference Result 1448 states and 2163 transitions. [2025-02-05 18:05:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 238 [2025-02-05 18:05:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:05,230 INFO L225 Difference]: With dead ends: 1448 [2025-02-05 18:05:05,232 INFO L226 Difference]: Without dead ends: 739 [2025-02-05 18:05:05,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:05,234 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:05,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1835 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-02-05 18:05:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-02-05 18:05:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 732 states have (on average 1.4931693989071038) internal successors, (1093), 732 states have internal predecessors, (1093), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 18:05:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1103 transitions. [2025-02-05 18:05:05,261 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1103 transitions. Word has length 238 [2025-02-05 18:05:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:05,261 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1103 transitions. [2025-02-05 18:05:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1103 transitions. [2025-02-05 18:05:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 18:05:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:05,265 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:05,277 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 18:05:05,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:05,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1107955379, now seen corresponding path program 1 times [2025-02-05 18:05:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104788572] [2025-02-05 18:05:05,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:05,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 18:05:05,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 18:05:05,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:05,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 18:05:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:05,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104788572] [2025-02-05 18:05:05,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104788572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132205101] [2025-02-05 18:05:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:05,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:05,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:05,983 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 18:05:05,986 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 18:05:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 18:05:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 18:05:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:06,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 18:05:06,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 18:05:06,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 18:05:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132205101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:05:07,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:05:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8] total 12 [2025-02-05 18:05:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938757631] [2025-02-05 18:05:07,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:05:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 18:05:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:07,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 18:05:07,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:05:07,484 INFO L87 Difference]: Start difference. First operand 739 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 28.916666666666668) internal successors, (347), 12 states have internal predecessors, (347), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 18:05:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:09,515 INFO L93 Difference]: Finished difference Result 2084 states and 3113 transitions. [2025-02-05 18:05:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:05:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 28.916666666666668) internal successors, (347), 12 states have internal predecessors, (347), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 241 [2025-02-05 18:05:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:09,523 INFO L225 Difference]: With dead ends: 2084 [2025-02-05 18:05:09,523 INFO L226 Difference]: Without dead ends: 1353 [2025-02-05 18:05:09,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:05:09,525 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 2682 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:09,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 4057 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 18:05:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-05 18:05:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 955. [2025-02-05 18:05:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 943 states have (on average 1.4899257688229057) internal successors, (1405), 943 states have internal predecessors, (1405), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1425 transitions. [2025-02-05 18:05:09,570 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1425 transitions. Word has length 241 [2025-02-05 18:05:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1425 transitions. [2025-02-05 18:05:09,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.916666666666668) internal successors, (347), 12 states have internal predecessors, (347), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 18:05:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1425 transitions. [2025-02-05 18:05:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 18:05:09,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:09,575 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:05:09,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 18:05:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:09,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:09,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash -995323652, now seen corresponding path program 1 times [2025-02-05 18:05:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207389054] [2025-02-05 18:05:09,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:09,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 18:05:09,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 18:05:09,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:09,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 18:05:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207389054] [2025-02-05 18:05:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207389054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351126492] [2025-02-05 18:05:10,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:10,321 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 18:05:10,323 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 18:05:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 18:05:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 18:05:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 18:05:10,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:10,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 18:05:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351126492] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:05:10,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:05:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2025-02-05 18:05:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303177538] [2025-02-05 18:05:10,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:05:10,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:05:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:10,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:05:10,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:05:10,889 INFO L87 Difference]: Start difference. First operand 955 states and 1425 transitions. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:11,423 INFO L93 Difference]: Finished difference Result 1936 states and 2894 transitions. [2025-02-05 18:05:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:05:11,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 245 [2025-02-05 18:05:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:11,428 INFO L225 Difference]: With dead ends: 1936 [2025-02-05 18:05:11,429 INFO L226 Difference]: Without dead ends: 994 [2025-02-05 18:05:11,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:05:11,432 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 58 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:11,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3700 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-02-05 18:05:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 990. [2025-02-05 18:05:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 978 states have (on average 1.4867075664621676) internal successors, (1454), 978 states have internal predecessors, (1454), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1474 transitions. [2025-02-05 18:05:11,473 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1474 transitions. Word has length 245 [2025-02-05 18:05:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:11,474 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1474 transitions. [2025-02-05 18:05:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1474 transitions. [2025-02-05 18:05:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 18:05:11,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:11,478 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:11,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 18:05:11,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:11,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:11,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -130568627, now seen corresponding path program 2 times [2025-02-05 18:05:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112766696] [2025-02-05 18:05:11,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 18:05:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:11,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 257 statements into 2 equivalence classes. [2025-02-05 18:05:11,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 172 of 257 statements. [2025-02-05 18:05:11,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 18:05:11,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 18:05:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112766696] [2025-02-05 18:05:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112766696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142236337] [2025-02-05 18:05:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:12,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:12,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:12,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:12,258 INFO L87 Difference]: Start difference. First operand 990 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:12,614 INFO L93 Difference]: Finished difference Result 994 states and 1478 transitions. [2025-02-05 18:05:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:12,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 257 [2025-02-05 18:05:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:12,622 INFO L225 Difference]: With dead ends: 994 [2025-02-05 18:05:12,622 INFO L226 Difference]: Without dead ends: 992 [2025-02-05 18:05:12,623 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 18:05:12,624 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 0 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:12,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2758 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-02-05 18:05:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2025-02-05 18:05:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 980 states have (on average 1.4857142857142858) internal successors, (1456), 980 states have internal predecessors, (1456), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1476 transitions. [2025-02-05 18:05:12,659 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1476 transitions. Word has length 257 [2025-02-05 18:05:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:12,660 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1476 transitions. [2025-02-05 18:05:12,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1476 transitions. [2025-02-05 18:05:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 18:05:12,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:12,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:12,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:05:12,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash 252019552, now seen corresponding path program 1 times [2025-02-05 18:05:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235493705] [2025-02-05 18:05:12,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:12,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 18:05:12,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 18:05:12,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:12,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 18:05:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235493705] [2025-02-05 18:05:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235493705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513167034] [2025-02-05 18:05:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:13,168 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 18:05:13,171 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 18:05:13,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 18:05:13,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 18:05:13,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:13,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:13,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 18:05:13,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 18:05:13,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513167034] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:05:13,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:05:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 15 [2025-02-05 18:05:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228174457] [2025-02-05 18:05:13,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:05:13,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 18:05:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:13,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 18:05:13,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:05:13,879 INFO L87 Difference]: Start difference. First operand 992 states and 1476 transitions. Second operand has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 states have internal predecessors, (254), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:15,028 INFO L93 Difference]: Finished difference Result 1991 states and 2967 transitions. [2025-02-05 18:05:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 18:05:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 states have internal predecessors, (254), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 258 [2025-02-05 18:05:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:15,035 INFO L225 Difference]: With dead ends: 1991 [2025-02-05 18:05:15,035 INFO L226 Difference]: Without dead ends: 1017 [2025-02-05 18:05:15,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-02-05 18:05:15,040 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 106 mSDsluCounter, 8351 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 9284 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:15,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 9284 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 18:05:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-02-05 18:05:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2025-02-05 18:05:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1005 states have (on average 1.483582089552239) internal successors, (1491), 1005 states have internal predecessors, (1491), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1511 transitions. [2025-02-05 18:05:15,074 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1511 transitions. Word has length 258 [2025-02-05 18:05:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:15,074 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1511 transitions. [2025-02-05 18:05:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 states have internal predecessors, (254), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1511 transitions. [2025-02-05 18:05:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 18:05:15,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:15,078 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:15,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 18:05:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:15,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1328434108, now seen corresponding path program 2 times [2025-02-05 18:05:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97838650] [2025-02-05 18:05:15,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 18:05:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:15,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-02-05 18:05:15,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 273 statements. [2025-02-05 18:05:15,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 18:05:15,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 18:05:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97838650] [2025-02-05 18:05:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97838650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:15,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:15,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:15,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4426237] [2025-02-05 18:05:15,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:15,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:15,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:15,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:15,675 INFO L87 Difference]: Start difference. First operand 1017 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:16,359 INFO L93 Difference]: Finished difference Result 1666 states and 2479 transitions. [2025-02-05 18:05:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 273 [2025-02-05 18:05:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:16,367 INFO L225 Difference]: With dead ends: 1666 [2025-02-05 18:05:16,367 INFO L226 Difference]: Without dead ends: 1019 [2025-02-05 18:05:16,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:16,369 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 0 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:16,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3443 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:05:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-02-05 18:05:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2025-02-05 18:05:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1007 states have (on average 1.4826216484607746) internal successors, (1493), 1007 states have internal predecessors, (1493), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1513 transitions. [2025-02-05 18:05:16,404 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1513 transitions. Word has length 273 [2025-02-05 18:05:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:16,405 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1513 transitions. [2025-02-05 18:05:16,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1513 transitions. [2025-02-05 18:05:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 18:05:16,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:16,410 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:16,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:05:16,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:16,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash 163294156, now seen corresponding path program 1 times [2025-02-05 18:05:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:16,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677859056] [2025-02-05 18:05:16,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:16,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 18:05:16,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 18:05:16,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:16,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-05 18:05:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677859056] [2025-02-05 18:05:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677859056] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040460105] [2025-02-05 18:05:16,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:16,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:16,966 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 18:05:16,968 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 18:05:17,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 18:05:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 18:05:17,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:17,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 18:05:17,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-05 18:05:17,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-05 18:05:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040460105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:05:17,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:05:17,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-02-05 18:05:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890052467] [2025-02-05 18:05:17,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:05:17,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 18:05:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:17,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 18:05:17,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-05 18:05:17,707 INFO L87 Difference]: Start difference. First operand 1019 states and 1513 transitions. Second operand has 18 states, 18 states have (on average 14.666666666666666) internal successors, (264), 18 states have internal predecessors, (264), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:18,930 INFO L93 Difference]: Finished difference Result 1976 states and 2945 transitions. [2025-02-05 18:05:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 18:05:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.666666666666666) internal successors, (264), 18 states have internal predecessors, (264), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 274 [2025-02-05 18:05:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:18,935 INFO L225 Difference]: With dead ends: 1976 [2025-02-05 18:05:18,935 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 18:05:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 18:05:18,938 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 156 mSDsluCounter, 9453 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 10404 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 10404 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 18:05:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 18:05:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-02-05 18:05:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1047 states have (on average 1.4794651384909265) internal successors, (1549), 1047 states have internal predecessors, (1549), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1569 transitions. [2025-02-05 18:05:19,010 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1569 transitions. Word has length 274 [2025-02-05 18:05:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:19,010 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1569 transitions. [2025-02-05 18:05:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.666666666666666) internal successors, (264), 18 states have internal predecessors, (264), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 18:05:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1569 transitions. [2025-02-05 18:05:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-05 18:05:19,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:19,015 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:19,027 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 18:05:19,215 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,SelfDestructingSolverStorable8 [2025-02-05 18:05:19,216 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 318182412, now seen corresponding path program 2 times [2025-02-05 18:05:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253461696] [2025-02-05 18:05:19,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 18:05:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:19,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 286 statements into 2 equivalence classes. [2025-02-05 18:05:19,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 174 of 286 statements. [2025-02-05 18:05:19,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 18:05:19,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253461696] [2025-02-05 18:05:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253461696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506231115] [2025-02-05 18:05:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:19,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:19,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:19,671 INFO L87 Difference]: Start difference. First operand 1059 states and 1569 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:20,143 INFO L93 Difference]: Finished difference Result 1714 states and 2544 transitions. [2025-02-05 18:05:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 286 [2025-02-05 18:05:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:20,148 INFO L225 Difference]: With dead ends: 1714 [2025-02-05 18:05:20,148 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 18:05:20,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:05:20,150 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 974 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:20,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1684 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 18:05:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-02-05 18:05:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1047 states have (on average 1.4775549188156638) internal successors, (1547), 1047 states have internal predecessors, (1547), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1567 transitions. [2025-02-05 18:05:20,184 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1567 transitions. Word has length 286 [2025-02-05 18:05:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:20,184 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1567 transitions. [2025-02-05 18:05:20,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1567 transitions. [2025-02-05 18:05:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 18:05:20,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:20,189 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:20,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:05:20,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -551138509, now seen corresponding path program 1 times [2025-02-05 18:05:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:20,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263735194] [2025-02-05 18:05:20,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 18:05:20,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 18:05:20,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:20,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263735194] [2025-02-05 18:05:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263735194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:20,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151308738] [2025-02-05 18:05:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:20,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:20,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:20,717 INFO L87 Difference]: Start difference. First operand 1059 states and 1567 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:21,267 INFO L93 Difference]: Finished difference Result 1708 states and 2533 transitions. [2025-02-05 18:05:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 287 [2025-02-05 18:05:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:21,273 INFO L225 Difference]: With dead ends: 1708 [2025-02-05 18:05:21,274 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 18:05:21,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:21,277 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 2014 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:21,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 1684 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 18:05:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-02-05 18:05:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1047 states have (on average 1.4765998089780326) internal successors, (1546), 1047 states have internal predecessors, (1546), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1566 transitions. [2025-02-05 18:05:21,318 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1566 transitions. Word has length 287 [2025-02-05 18:05:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:21,319 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1566 transitions. [2025-02-05 18:05:21,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1566 transitions. [2025-02-05 18:05:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-02-05 18:05:21,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:21,323 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:05:21,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1308614130, now seen corresponding path program 1 times [2025-02-05 18:05:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280128066] [2025-02-05 18:05:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:21,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 18:05:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 18:05:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280128066] [2025-02-05 18:05:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280128066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:22,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985224519] [2025-02-05 18:05:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:22,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:22,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:22,020 INFO L87 Difference]: Start difference. First operand 1059 states and 1566 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:22,554 INFO L93 Difference]: Finished difference Result 1714 states and 2539 transitions. [2025-02-05 18:05:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 288 [2025-02-05 18:05:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:22,562 INFO L225 Difference]: With dead ends: 1714 [2025-02-05 18:05:22,562 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 18:05:22,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:22,565 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 2050 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:22,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1684 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 18:05:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-02-05 18:05:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1047 states have (on average 1.4746895893027698) internal successors, (1544), 1047 states have internal predecessors, (1544), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1564 transitions. [2025-02-05 18:05:22,607 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1564 transitions. Word has length 288 [2025-02-05 18:05:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:22,609 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1564 transitions. [2025-02-05 18:05:22,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1564 transitions. [2025-02-05 18:05:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-05 18:05:22,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:22,612 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:05:22,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1816643598, now seen corresponding path program 1 times [2025-02-05 18:05:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457720078] [2025-02-05 18:05:22,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:22,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-05 18:05:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-05 18:05:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:22,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:23,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457720078] [2025-02-05 18:05:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457720078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:23,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:23,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015527586] [2025-02-05 18:05:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:23,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:23,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:23,307 INFO L87 Difference]: Start difference. First operand 1059 states and 1564 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:23,786 INFO L93 Difference]: Finished difference Result 1708 states and 2528 transitions. [2025-02-05 18:05:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 289 [2025-02-05 18:05:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:23,792 INFO L225 Difference]: With dead ends: 1708 [2025-02-05 18:05:23,792 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 18:05:23,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 18:05:23,795 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 947 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:23,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1684 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 18:05:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-02-05 18:05:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1047 states have (on average 1.4737344794651386) internal successors, (1543), 1047 states have internal predecessors, (1543), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1563 transitions. [2025-02-05 18:05:23,830 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1563 transitions. Word has length 289 [2025-02-05 18:05:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:23,831 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1563 transitions. [2025-02-05 18:05:23,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1563 transitions. [2025-02-05 18:05:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-02-05 18:05:23,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:23,835 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:05:23,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 491156630, now seen corresponding path program 1 times [2025-02-05 18:05:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393551349] [2025-02-05 18:05:23,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:23,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-02-05 18:05:24,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-02-05 18:05:24,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:24,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393551349] [2025-02-05 18:05:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393551349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:05:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33278781] [2025-02-05 18:05:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:05:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:25,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:05:25,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:05:25,459 INFO L87 Difference]: Start difference. First operand 1059 states and 1563 transitions. Second operand has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 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 18:05:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:26,252 INFO L93 Difference]: Finished difference Result 1812 states and 2679 transitions. [2025-02-05 18:05:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:05:26,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 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 290 [2025-02-05 18:05:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:26,258 INFO L225 Difference]: With dead ends: 1812 [2025-02-05 18:05:26,258 INFO L226 Difference]: Without dead ends: 1083 [2025-02-05 18:05:26,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:05:26,261 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 1029 mSDsluCounter, 4451 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 5351 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:26,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 5351 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:05:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-02-05 18:05:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1077. [2025-02-05 18:05:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1065 states have (on average 1.4732394366197183) internal successors, (1569), 1065 states have internal predecessors, (1569), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1589 transitions. [2025-02-05 18:05:26,301 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1589 transitions. Word has length 290 [2025-02-05 18:05:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:26,302 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1589 transitions. [2025-02-05 18:05:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 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 18:05:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1589 transitions. [2025-02-05 18:05:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 18:05:26,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:26,306 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:05:26,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1785209617, now seen corresponding path program 1 times [2025-02-05 18:05:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778721592] [2025-02-05 18:05:26,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:26,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 18:05:26,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 18:05:26,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:26,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778721592] [2025-02-05 18:05:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778721592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850673620] [2025-02-05 18:05:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:26,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:26,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:26,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:26,921 INFO L87 Difference]: Start difference. First operand 1077 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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 18:05:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:27,583 INFO L93 Difference]: Finished difference Result 1833 states and 2709 transitions. [2025-02-05 18:05:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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 291 [2025-02-05 18:05:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:27,589 INFO L225 Difference]: With dead ends: 1833 [2025-02-05 18:05:27,590 INFO L226 Difference]: Without dead ends: 1081 [2025-02-05 18:05:27,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:27,592 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 0 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:27,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3427 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:05:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-02-05 18:05:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2025-02-05 18:05:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.471468662301216) internal successors, (1573), 1069 states have internal predecessors, (1573), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1593 transitions. [2025-02-05 18:05:27,630 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1593 transitions. Word has length 291 [2025-02-05 18:05:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:27,631 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1593 transitions. [2025-02-05 18:05:27,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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 18:05:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1593 transitions. [2025-02-05 18:05:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-02-05 18:05:27,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:27,634 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:05:27,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:27,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash -767451488, now seen corresponding path program 1 times [2025-02-05 18:05:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034736728] [2025-02-05 18:05:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-02-05 18:05:27,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-02-05 18:05:27,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:27,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:28,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034736728] [2025-02-05 18:05:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034736728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:28,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:05:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459652750] [2025-02-05 18:05:28,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:05:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:28,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:05:28,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:28,159 INFO L87 Difference]: Start difference. First operand 1081 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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 18:05:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:29,370 INFO L93 Difference]: Finished difference Result 2438 states and 3603 transitions. [2025-02-05 18:05:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:05:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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 291 [2025-02-05 18:05:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:29,376 INFO L225 Difference]: With dead ends: 2438 [2025-02-05 18:05:29,376 INFO L226 Difference]: Without dead ends: 1089 [2025-02-05 18:05:29,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:05:29,380 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 724 mSDsluCounter, 5135 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 6623 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:29,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 6623 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 18:05:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-05 18:05:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1085. [2025-02-05 18:05:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1073 states have (on average 1.4697110904007455) internal successors, (1577), 1073 states have internal predecessors, (1577), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1597 transitions. [2025-02-05 18:05:29,421 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1597 transitions. Word has length 291 [2025-02-05 18:05:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:29,422 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1597 transitions. [2025-02-05 18:05:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 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 18:05:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1597 transitions. [2025-02-05 18:05:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 18:05:29,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:29,427 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:29,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:05:29,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -709439781, now seen corresponding path program 1 times [2025-02-05 18:05:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178113840] [2025-02-05 18:05:29,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 18:05:29,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 18:05:29,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:29,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178113840] [2025-02-05 18:05:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178113840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486908117] [2025-02-05 18:05:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:30,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:30,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:30,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:30,070 INFO L87 Difference]: Start difference. First operand 1085 states and 1597 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 18:05:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:30,432 INFO L93 Difference]: Finished difference Result 1823 states and 2689 transitions. [2025-02-05 18:05:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 292 [2025-02-05 18:05:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:30,442 INFO L225 Difference]: With dead ends: 1823 [2025-02-05 18:05:30,446 INFO L226 Difference]: Without dead ends: 1081 [2025-02-05 18:05:30,449 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 18:05:30,454 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 1006 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:30,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1815 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-02-05 18:05:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2025-02-05 18:05:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.4695977549111319) internal successors, (1571), 1069 states have internal predecessors, (1571), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 18:05:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1591 transitions. [2025-02-05 18:05:30,542 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1591 transitions. Word has length 292 [2025-02-05 18:05:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1591 transitions. [2025-02-05 18:05:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 18:05:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1591 transitions. [2025-02-05 18:05:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 18:05:30,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:30,554 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:05:30,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1501738493, now seen corresponding path program 1 times [2025-02-05 18:05:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031686476] [2025-02-05 18:05:30,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:30,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 18:05:30,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 18:05:30,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:30,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 18:05:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031686476] [2025-02-05 18:05:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031686476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:31,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:05:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666774679] [2025-02-05 18:05:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:05:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:31,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:05:31,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:31,944 INFO L87 Difference]: Start difference. First operand 1081 states and 1591 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:32,724 INFO L93 Difference]: Finished difference Result 2072 states and 3058 transitions. [2025-02-05 18:05:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:05:32,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 292 [2025-02-05 18:05:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:32,731 INFO L225 Difference]: With dead ends: 2072 [2025-02-05 18:05:32,731 INFO L226 Difference]: Without dead ends: 1412 [2025-02-05 18:05:32,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:05:32,733 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 1794 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:32,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 4495 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:05:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-02-05 18:05:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2025-02-05 18:05:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1395 states have (on average 1.4695340501792116) internal successors, (2050), 1395 states have internal predecessors, (2050), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2080 transitions. [2025-02-05 18:05:32,772 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2080 transitions. Word has length 292 [2025-02-05 18:05:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:32,773 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2080 transitions. [2025-02-05 18:05:32,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 18:05:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2080 transitions. [2025-02-05 18:05:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-02-05 18:05:32,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:32,781 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:05:32,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1153467641, now seen corresponding path program 1 times [2025-02-05 18:05:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645313624] [2025-02-05 18:05:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:32,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-02-05 18:05:33,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-02-05 18:05:33,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:33,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:33,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645313624] [2025-02-05 18:05:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645313624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819114139] [2025-02-05 18:05:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:33,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:33,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:33,701 INFO L87 Difference]: Start difference. First operand 1412 states and 2080 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:33,997 INFO L93 Difference]: Finished difference Result 2073 states and 3059 transitions. [2025-02-05 18:05:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:33,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 647 [2025-02-05 18:05:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:34,008 INFO L225 Difference]: With dead ends: 2073 [2025-02-05 18:05:34,012 INFO L226 Difference]: Without dead ends: 1413 [2025-02-05 18:05:34,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:34,014 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 0 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:34,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1831 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-02-05 18:05:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2025-02-05 18:05:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1396 states have (on average 1.4691977077363896) internal successors, (2051), 1396 states have internal predecessors, (2051), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2081 transitions. [2025-02-05 18:05:34,051 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2081 transitions. Word has length 647 [2025-02-05 18:05:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:34,052 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2081 transitions. [2025-02-05 18:05:34,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2081 transitions. [2025-02-05 18:05:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 18:05:34,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:34,059 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:34,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:05:34,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:34,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1863370046, now seen corresponding path program 1 times [2025-02-05 18:05:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:34,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661699786] [2025-02-05 18:05:34,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:34,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 18:05:34,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 18:05:34,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:34,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661699786] [2025-02-05 18:05:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661699786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192577022] [2025-02-05 18:05:35,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:35,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:35,136 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 18:05:35,138 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 18:05:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 18:05:36,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 18:05:36,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:36,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:36,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 3301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 18:05:36,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-05 18:05:37,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:05:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192577022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:37,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:05:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 18:05:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974008067] [2025-02-05 18:05:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:37,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:37,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:37,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:37,088 INFO L87 Difference]: Start difference. First operand 1413 states and 2081 transitions. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:37,617 INFO L93 Difference]: Finished difference Result 2073 states and 3058 transitions. [2025-02-05 18:05:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 648 [2025-02-05 18:05:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:37,623 INFO L225 Difference]: With dead ends: 2073 [2025-02-05 18:05:37,623 INFO L226 Difference]: Without dead ends: 1412 [2025-02-05 18:05:37,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:37,625 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 829 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:37,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1352 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-02-05 18:05:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2025-02-05 18:05:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1395 states have (on average 1.468100358422939) internal successors, (2048), 1395 states have internal predecessors, (2048), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2078 transitions. [2025-02-05 18:05:37,660 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2078 transitions. Word has length 648 [2025-02-05 18:05:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:37,660 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2078 transitions. [2025-02-05 18:05:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2078 transitions. [2025-02-05 18:05:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 18:05:37,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:37,667 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:37,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 18:05:37,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:37,868 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:37,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -266461897, now seen corresponding path program 1 times [2025-02-05 18:05:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198572974] [2025-02-05 18:05:37,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 18:05:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 18:05:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:38,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198572974] [2025-02-05 18:05:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198572974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344098404] [2025-02-05 18:05:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:38,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:38,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:38,775 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 18:05:38,777 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 18:05:39,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 18:05:39,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 18:05:39,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:39,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:39,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 18:05:39,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-05 18:05:40,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:05:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344098404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:05:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 18:05:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390198895] [2025-02-05 18:05:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:40,486 INFO L87 Difference]: Start difference. First operand 1412 states and 2078 transitions. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:40,985 INFO L93 Difference]: Finished difference Result 2071 states and 3052 transitions. [2025-02-05 18:05:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 649 [2025-02-05 18:05:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:40,989 INFO L225 Difference]: With dead ends: 2071 [2025-02-05 18:05:40,989 INFO L226 Difference]: Without dead ends: 1411 [2025-02-05 18:05:40,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:40,991 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 821 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:40,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1352 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-02-05 18:05:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2025-02-05 18:05:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1394 states have (on average 1.4670014347202296) internal successors, (2045), 1394 states have internal predecessors, (2045), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2075 transitions. [2025-02-05 18:05:41,024 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2075 transitions. Word has length 649 [2025-02-05 18:05:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2075 transitions. [2025-02-05 18:05:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2075 transitions. [2025-02-05 18:05:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 18:05:41,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:41,031 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:41,050 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 18:05:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:41,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 600159576, now seen corresponding path program 1 times [2025-02-05 18:05:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896070675] [2025-02-05 18:05:41,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:41,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 18:05:41,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 18:05:41,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:41,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896070675] [2025-02-05 18:05:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896070675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788589803] [2025-02-05 18:05:42,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:42,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:42,296 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 18:05:42,298 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 18:05:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 18:05:43,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 18:05:43,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:43,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:43,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 3307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 18:05:43,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-05 18:05:44,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:05:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788589803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:05:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 18:05:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100331266] [2025-02-05 18:05:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:44,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:44,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:44,071 INFO L87 Difference]: Start difference. First operand 1411 states and 2075 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:44,562 INFO L93 Difference]: Finished difference Result 2069 states and 3046 transitions. [2025-02-05 18:05:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:44,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 650 [2025-02-05 18:05:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:44,568 INFO L225 Difference]: With dead ends: 2069 [2025-02-05 18:05:44,568 INFO L226 Difference]: Without dead ends: 1410 [2025-02-05 18:05:44,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:44,571 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 807 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:44,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1352 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-02-05 18:05:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-02-05 18:05:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1393 states have (on average 1.4659009332376167) internal successors, (2042), 1393 states have internal predecessors, (2042), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2072 transitions. [2025-02-05 18:05:44,597 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2072 transitions. Word has length 650 [2025-02-05 18:05:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:44,598 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2072 transitions. [2025-02-05 18:05:44,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2072 transitions. [2025-02-05 18:05:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 18:05:44,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:44,604 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:44,621 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 18:05:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:44,805 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1836508320, now seen corresponding path program 1 times [2025-02-05 18:05:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997519932] [2025-02-05 18:05:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 18:05:45,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 18:05:45,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:45,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997519932] [2025-02-05 18:05:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997519932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585428931] [2025-02-05 18:05:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:45,570 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 18:05:45,627 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 18:05:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 18:05:46,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 18:05:46,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:46,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:46,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 3310 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 18:05:46,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-02-05 18:05:47,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-05 18:05:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585428931] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:05:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-02-05 18:05:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658459030] [2025-02-05 18:05:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:47,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:47,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 18:05:47,988 INFO L87 Difference]: Start difference. First operand 1410 states and 2072 transitions. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:48,349 INFO L93 Difference]: Finished difference Result 2068 states and 3041 transitions. [2025-02-05 18:05:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 651 [2025-02-05 18:05:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:48,354 INFO L225 Difference]: With dead ends: 2068 [2025-02-05 18:05:48,355 INFO L226 Difference]: Without dead ends: 1410 [2025-02-05 18:05:48,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1287 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-05 18:05:48,356 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 1797 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 1670 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-02-05 18:05:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-02-05 18:05:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1393 states have (on average 1.4651830581478822) internal successors, (2041), 1393 states have internal predecessors, (2041), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2071 transitions. [2025-02-05 18:05:48,385 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2071 transitions. Word has length 651 [2025-02-05 18:05:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:48,385 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2071 transitions. [2025-02-05 18:05:48,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2071 transitions. [2025-02-05 18:05:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-02-05 18:05:48,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:48,392 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:48,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 18:05:48,592 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,SelfDestructingSolverStorable22 [2025-02-05 18:05:48,592 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 731382403, now seen corresponding path program 1 times [2025-02-05 18:05:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278405633] [2025-02-05 18:05:48,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:48,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-02-05 18:05:48,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-02-05 18:05:48,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:48,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278405633] [2025-02-05 18:05:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278405633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328718848] [2025-02-05 18:05:49,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:49,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:49,278 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 18:05:49,280 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 18:05:50,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-02-05 18:05:50,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-02-05 18:05:50,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:50,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:50,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 3313 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 18:05:50,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-02-05 18:05:51,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-05 18:05:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328718848] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:51,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:05:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-02-05 18:05:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330656090] [2025-02-05 18:05:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:51,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:51,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:51,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 18:05:51,829 INFO L87 Difference]: Start difference. First operand 1410 states and 2071 transitions. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:52,207 INFO L93 Difference]: Finished difference Result 2068 states and 3039 transitions. [2025-02-05 18:05:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 652 [2025-02-05 18:05:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:52,213 INFO L225 Difference]: With dead ends: 2068 [2025-02-05 18:05:52,213 INFO L226 Difference]: Without dead ends: 1410 [2025-02-05 18:05:52,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1289 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-05 18:05:52,215 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 1773 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:52,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 1670 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-02-05 18:05:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-02-05 18:05:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1393 states have (on average 1.4644651830581479) internal successors, (2040), 1393 states have internal predecessors, (2040), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2070 transitions. [2025-02-05 18:05:52,260 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2070 transitions. Word has length 652 [2025-02-05 18:05:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:52,261 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2070 transitions. [2025-02-05 18:05:52,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2070 transitions. [2025-02-05 18:05:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-05 18:05:52,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:52,270 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:52,288 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 18:05:52,471 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,SelfDestructingSolverStorable23 [2025-02-05 18:05:52,472 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 949298631, now seen corresponding path program 1 times [2025-02-05 18:05:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127567961] [2025-02-05 18:05:52,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:52,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 18:05:52,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 18:05:52,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:52,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127567961] [2025-02-05 18:05:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127567961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644372777] [2025-02-05 18:05:53,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:53,306 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 18:05:53,309 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 18:05:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 18:05:54,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 18:05:54,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:54,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3316 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 18:05:54,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 276 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-02-05 18:05:55,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-05 18:05:55,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644372777] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:55,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:05:55,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-02-05 18:05:55,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178577897] [2025-02-05 18:05:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:55,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:55,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:55,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:55,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 18:05:55,959 INFO L87 Difference]: Start difference. First operand 1410 states and 2070 transitions. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:56,330 INFO L93 Difference]: Finished difference Result 2068 states and 3037 transitions. [2025-02-05 18:05:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 653 [2025-02-05 18:05:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:56,336 INFO L225 Difference]: With dead ends: 2068 [2025-02-05 18:05:56,336 INFO L226 Difference]: Without dead ends: 1410 [2025-02-05 18:05:56,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-05 18:05:56,338 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 882 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:56,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1679 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-02-05 18:05:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-02-05 18:05:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1393 states have (on average 1.4637473079684136) internal successors, (2039), 1393 states have internal predecessors, (2039), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 18:05:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2069 transitions. [2025-02-05 18:05:56,378 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2069 transitions. Word has length 653 [2025-02-05 18:05:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:56,379 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2069 transitions. [2025-02-05 18:05:56,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 18:05:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2069 transitions. [2025-02-05 18:05:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-02-05 18:05:56,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:56,385 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:56,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 18:05:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:56,587 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:56,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:56,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1290433913, now seen corresponding path program 1 times [2025-02-05 18:05:56,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:56,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951004804] [2025-02-05 18:05:56,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:56,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-02-05 18:05:56,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-02-05 18:05:56,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:56,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-05 18:05:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951004804] [2025-02-05 18:05:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951004804] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580321641] [2025-02-05 18:05:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:57,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:57,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:57,417 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 18:05:57,419 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 18:05:58,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-02-05 18:05:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-02-05 18:05:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:58,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 3319 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 18:05:58,659 INFO L279 TraceCheckSpWp]: Computing forward predicates...